Merge Sort is a sorting algorithm that works by...

Merge Sort is a sorting algorithm that works by...

• A. Bubble sort
• B. Merge Sort
• C. Quick sort
• D. Selection sort

Answer: (B)

The method being tested is division and merge. Merge sort splits the list into halves repeatedly until each piece has a single item, then merges those pieces back together in sorted order. The crucial step is taking two already sorted sequences and combining them by repeatedly picking the smaller front element, which builds up a fully sorted list. This merge operation is what sets merge sort apart from other strategies that rely on swapping or partitioning elements. Other algorithms mentioned work differently: one repeatedly swaps adjacent elements to bubble the smallest to the front; another partitions the list around a chosen pivot and sorts the partitions; another repeatedly selects the smallest unsorted element and places it into its final position. None of these describe the process of merging two sorted halves, which is the defining behavior of merge sort.

The method being tested is division and merge. Merge sort splits the list into halves repeatedly until each piece has a single item, then merges those pieces back together in sorted order. The crucial step is taking two already sorted sequences and combining them by repeatedly picking the smaller front element, which builds up a fully sorted list. This merge operation is what sets merge sort apart from other strategies that rely on swapping or partitioning elements.

Other algorithms mentioned work differently: one repeatedly swaps adjacent elements to bubble the smallest to the front; another partitions the list around a chosen pivot and sorts the partitions; another repeatedly selects the smallest unsorted element and places it into its final position. None of these describe the process of merging two sorted halves, which is the defining behavior of merge sort.