Which sorting algorithm splits a list into individual lists, then combines two lists at a time?

Which sorting algorithm splits a list into individual lists, then combines two lists at a time?

• A. Binary Search
• B. Merge Sort
• C. Randomization
• D. Heuristic Solution

Answer: (B)

The concept being tested is a divide-and-conquer sorting approach that builds up a sorted list by repeatedly splitting and then merging. In this method, you first break the list down into halves until you end up with single-element lists. Then you pair and merge these lists two at a time to form larger sorted lists, continuing this merge process until one fully sorted list remains. This “split into singletons, then merge” cycle is the hallmark of this sorting technique, making it the best fit for the description. Other options describe different ideas: a search method, not sorting; a generic, non-deterministic approach; or a broad problem-solving strategy rather than a specific sorting algorithm.

The concept being tested is a divide-and-conquer sorting approach that builds up a sorted list by repeatedly splitting and then merging. In this method, you first break the list down into halves until you end up with single-element lists. Then you pair and merge these lists two at a time to form larger sorted lists, continuing this merge process until one fully sorted list remains. This “split into singletons, then merge” cycle is the hallmark of this sorting technique, making it the best fit for the description.

Other options describe different ideas: a search method, not sorting; a generic, non-deterministic approach; or a broad problem-solving strategy rather than a specific sorting algorithm.