Sorting Algorithms

Which of the following is not a sorting algorithm?

• Bubble
• Insertion
• Binary
• Merge

Which sorting algorithm is described by moving through a list repeatedly, swapping elements that are in the wrong order?

• Merge
• Bubble
• Insertion
• None of the above

Which sorting algorithm is described by: split a list into individual lists, then combine these, two lists at a time.

• Merge
• Bubble
• Insertion
• None of the above

Which sorting algorithm is described by taking each item in turn, compare it to the items in the sorted list and place it in the ordered position in the sorted list?

• Merge
• Bubble
• Insertion
• None of the above

The following two lists are to be merged, which element first goes into the new merged list?
List 1
2  4  8  9
List 2
1  6  8  4

• 0
• 1
• 2
• 3

The following list is to be sorted using a bubble sort:
12  6  8  1  3
What will the list look like after the first iteration through the list?

• 6  8  1  3  12
• 6 12  1  8   3
• 1  3  6  8  12
• 6  8  1  12  3

How many passes will a bubble sort go through?

• One pass

• Two passes

• Multiple passes

• Five passes

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
  

Which of the following is an advantage of a bubble sort?

• It is a very small and simple computer program
  
• It takes a very long time to run
• It is very quick
  

Which of the following is NOT an advantage of a bubble sort?

• It is a very small and simple computer program
• There is only one task to perform
• It is very quick