Merge Sort

What does a sorting algorithm do?

• Finds an item of data in a set of data

• Saves a set of data

• Puts a list of items into order

• Copies a list of items

Which of the following is not a sorting algorithm?

• Bubble Sort

• Insertion Sort

• Merge Sort

• All Sort

How does a merge sort work?

• It sorts a list by comparing neighbouring items to see which is out of order

• It takes one item from the list and places it in the correct place

• It finds an item of data in a list

• It divides the list into sublists and then merges pairs of sublists together to sort the data.

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

• It's simple to implement

• It takes a long time to run

• It's quick and efficient for sorting long lists

• There is no advantage of using a merge sort

8.Which of the following is a disadvantage of a merge sort?

• It takes a very long time to run

• It uses more memory than a bubble sort

• It is more complex to implement

• There is no disadvantage of using a merge sort

Arrange these stages of a merge sort in the correct order.

• Combine two single items into a sorted pair

• Combine the sub-lists into a new sorted list

• Repeatedly halve the lists into sub-lists

• Stop dividing when the list is a single item

• Repeat until there is a single sorted list

What's the next line of merge sort? Do not leave spaces between items, only commas

(a)  

What is the subsequent line of merge sort? No spaces only commas

(a)  

During the FIRST comparison of the FINAL stage, the two numbers compared are 1 and ?

• 2

• 4

• 1

• 3

During the SECOND comparison of the final stage, the two numbers compared are ? and ?

• 2 and 2

• 1 and 2

• 6 and 7

• 2 and 4