Merge Sort (D&C)
← Back to Divide and Conquer
The canonical divide-and-conquer sorting algorithm. Divides the array in half, recursively sorts each half, and merges the results. Demonstrates how D&C achieves O(n log n) by decomposing the problem into independent subproblems.