Merge Sort Quiz

What is the primary objective of the lesson on merge sort?

• To analyze sorting algorithms

• To create unordered lists

• To learn about bubble sort

• To merge two ordered lists into a new ordered list

Which of the following best describes merge sort?

• A method for creating unordered lists

• A simple sorting algorithm

• An efficient divide and conquer algorithm

• A linear search algorithm

What happens during the splitting phase of merge sort?

• Lists are split in half until each item is alone

• Lists are combined into one

• Items are sorted in descending order

• Items are randomly shuffled

What is the first step in the merging phase of merge sort?

• Combine all items into one list

• Remove duplicates from the lists

• Sort the items in descending order

• Create a new empty list for merged items

Which of the following statements is true about merge sort?

• It does not use a divide and conquer approach

• It is easier to implement than bubble sort

• It requires less memory than bubble sort

• It is faster than bubble sort for large datasets

What is the result of merging the lists 'Daisy' and 'Nina'?

• Both names are combined into one

• Daisy comes before Nina

• Nina comes before Daisy

• Neither name is included in the merged list

What is the final step when one of the lists is empty during merging?

• Remove duplicates from the merged list

• Stop the merging process

• Copy the remaining items from the other list

• Sort the remaining items

In the context of merge sort, what does 'divide and conquer' refer to?

• Sorting items in reverse order

• Breaking down a problem into smaller parts

• Eliminating unnecessary items

• Combining all items into one list

What is the main disadvantage of merge sort compared to bubble sort?

• It cannot sort large datasets

• It is easier to implement

• It requires more memory

• It is less efficient

What is the purpose of the 'Think, write, pair, share' activity mentioned in the lesson?

• To discuss the steps of merge sort

• To create unordered lists

• To analyze the efficiency of bubble sort

• To brainstorm ideas for sorting algorithms