1.2.6 - Merge Sort

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

• Easier to program

• Faster with small datasets

• Higher efficiency with large datasets

• Less memory usage

What method does merge sort use to sort data?

• Random access

• Increment and conquer

• Sequential access

• Divide and conquer

During the merge sort process, what is the first step?

• Merge all items into one list

• Split the list into individual items

• Compare each item with a pivot

• Sort each list individually

Which cereal is compared first in the merge sort example?

• Weetabix and Fruit 'n' Fibre

• Sugar Puffs and Crunchy Nut Clusters

• Crunchy Nut Clusters and Weetabix

• Cornflakes and Sugar Puffs

What happens to Cornflakes in the initial rounds of merging?

• It is compared with Crunchy Nut Clusters

• It remains in its own list

• It is merged with Weetabix

• It is discarded from the list

Which cereal ends up at the top of the sorted list in the merge sort example?

• Weetabix

• Sugar Puffs

• Cornflakes

• Crunchy Nut Clusters

What is a significant disadvantage of merge sort compared to bubble sort?

• Is less efficient

• Easier to understand

• Cannot handle large lists

• Requires more memory

Which sorting algorithm is described as suitable only for small lists or learning purposes?

• Quick sort

• Insertion sort

• Bubble sort

• Merge sort