Video 60 - Merge Sort

What is the advantage of using merge sort over bubble sort?

• Merge sort can work on multiple lists at the same time

• Merge sort is easier to program than bubble sort

• Merge sort is more efficient for small data sets

• Merge sort does not require any comparisons

What method does merge sort use to solve problems?

• Divide-and-conquer

• Bubble sort

• Selection sort

• Insertion sort

What happens to the data set in merge sort?

• It is repeatedly split in half until each item is in its own list

• It is sorted in reverse order

• It is combined with another data set

• It is randomly rearranged

What is the purpose of merging adjacent items in merge sort?

• To combine their solutions and solve the bigger problem

• To create identical sub-problems

• To split the data set in half

• To compare items in adjacent lists

Which algorithm works well for large data sets?

• Merge sort

• Bubble sort

• Selection sort

• Insertion sort

What is the first step in the merge sort algorithm?

• Splitting the initial list into individual lists of one item

• Comparing items in adjacent lists

• Merging adjacent items

• Sorting the data set in alphabetical order

What happens if an item in merge sort has nothing to compare to?

• It goes into a new list on its own

• It is skipped and ignored

• It is merged with the previous item

• It is removed from the data set

What is the final step in the merge sort algorithm?

• Comparing the bottom item of the bottom list with the bottom item of the top list

• Moving all the remaining items to the new merged list

• Sorting the data set in reverse order

• Removing any duplicate items