Merge Sort

What are the two simple sorting algorithms mentioned?

• Merge sort and Quick sort

• Bubble sort and Insertion sort

• Bubble sort and Merge sort

• Selection sort and Heap sort

Why are bubble sort and insertion sort not good for large lists?

• They require too much memory

• They are too complex

• They are slow

• They cannot sort large numbers

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

What makes the merge sort algorithm memory intensive?

• It requires additional arrays

• It keeps track of many sub-lists in memory

• It uses recursion

• It sorts data in place

What is the main use of the merge sort?

• Sorting numerical data only

• Sorting large lists of unsorted data

• Sorting small lists

• Sorting data in databases

What is the final stage of the merge sort called?

• The divide stage

• The conquer stage

• The merge stage

• The sort stage

How are individual sub-lists sorted and merged in the merge sort?

• Alphabetically from A to Z

• Numerically from lowest to highest

• Based on their length

• Randomly

What happens to the list during the divide stage of merge sort?

• It is merged into a single list

• It is rearranged randomly

• It is divided into sub-lists of length 1

• It is sorted alphabetically