Why merge sort is known as divide and conquer sort?
Answers
Answered by
0
Both merge sort and quicksort employ a common algorithmic paradigm based on recursion. This paradigm,divide-and-conquer, breaks a problem into subproblems that are similar to the original problem, recursively solves the subproblems, and finally combines the solutions to the subproblems to solve the original problem.
Similar questions