Merge Sort Starter

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

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

• Merge

• Bubble

• Insertion

• Binary

What's the next line of merge sort? No spaces, only commas

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

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

What type of algorithm is the merge sort?

• Exchange sort

• Incremental sort

• Divide and conquer

• Selection sort

What is the first step in the merge sort process?

• Sorting the list

• Merging the list

• Breaking down the list into sub-lists

• Comparing elements

How does the merge sort algorithm begin sorting data?

• By swapping all elements

• By selecting the smallest element

• By dividing the list into two equal parts

• By creating pairs of smaller lists