Merge sort is best defined as which of the following?
- A. An algorithmic technique that solves problems by breaking them into overlapping subproblems and storing results.
- B. A divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them. ✓
- C. A mathematical notation used to describe the upper bound of an algorithm's time or space complexity.
- D. An algorithmic approach that makes the locally optimal choice at each step, hoping to find a global optimum.
Correct answer
B. A divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them.
Explanation
Merge sort refers to a divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them.