Merge Sort is an example of which algorithm design paradigm?
2024
Merge Sort is an example of which algorithm design paradigm?
Answer: B. Divide and Conquer — Merge Sort works by recursively dividing the array into two halves until each subarray has one element, then merging them in sorted order. This process…
- A.
Greedy
- B.
Divide and Conquer
- C.
Dynamic Programming
- D.
More than one of the above
- E.
None of the above
Attempted by 1700 students.
Show answer & explanation
Correct answer: B
Merge Sort works by recursively dividing the array into two halves until each subarray has one element, then merging them in sorted order. This process follows the divide and conquer paradigm, where a problem is broken into smaller subproblems, solved independently, and then combined to form the final solution.
Loading lesson…