Merge sort

What type of algorithm is Merge Sort?

• Bubble Sort

• Insertion Sort

• Divide and Conquer

• Quick Sort

What is the initial step in the Merge Sort algorithm?

• Sorting elements within each sublist

• Merging sublists

• Dividing the list into smaller sublists until each contains only one element

• Swapping adjacent elements

When dividing a list in Merge Sort, what is the stopping condition?

• The list is sorted

• Each sublist contains only one element

• The list is divided into two equal halves

• All elements are unique

Are you enjoying the video lesson?

• Yes

• No

After dividing the list into single-element sublists, what is the next phase of Merge Sort?

• Re-dividing the sublists

• Recombining and sorting the sublists

• Shuffling the elements randomly

• Deleting duplicate elements

What makes Merge Sort efficient when recombining lists?

• It uses a random pivot

• It only needs to look at the first number of each sublist because they are already ordered

• It performs swaps only when necessary

• It sorts elements in place