Sorting Algorithms

What does a bubble sort do?

• Sorts a list by comparing two items that are side by side, to see which is out of order
• Separates a list of data into different collections of data, before sorting and gathering back into a list
• Finds an item of data in a list

Why does a bubble sort do a final pass even when the data is in the correct order?

• To save the data
• It does not recognise that the data is in order until the final pass requires no changes
  
• It needs to do this to put the data back in to a list
  

What does an insertion sort do?

• Separates a list of data into different collections of data which are sorted and gathered back into a list
• Goes through a list of data a number of times and compares two items that are side by side to each other to see which is out of order
• Goes through a list, comparing two items that are side by side, and continues to move one value until it is in the correct place.

Which type of sort algorithm is this?

• Bubble
• Merge
• Insertion

Which type of sort algorithm is this?

• Insertion
• Merge
• Bubble

We are sorting the following list in ascending order:
 
1    4    2    9    3    8    5
 
What does the list look like after one pass of the bubble sort algorithm. 

• 1 2 4 3 8 5 9
• 1 4 2 5 3 8 9
• 4 2 9 3 8 5 1

Which type of sort algorithm is this?

• Bubble
• Merge
• Insertion

Which of these algorithms compares consecutive pairs of items and swaps two items if they're not in order?

• Bubble sort

• Linear search

• Merge sort

• Binary search

Which algorithm uses a divide and conquer approach?

• Linear Search

• Binary Search

The worst-case time complexity of a quick sort algorithm?

• O(nlogn)

• O(logn)

• O(n^2)

• O(n^2logn)