Identify the correct concept described as: a divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them.
- A. Time complexity
- B. Greedy algorithm
- C. Merge sort ✓
- D. Breadth-first search (BFS)
Correct answer
C. Merge sort
Explanation
Merge sort refers to a divide-and-conquer sorting algorithm that splits the array, sorts each half, and merges them.