Tag: divide-and-conquer

Merge sort emerged from John von Neumann’s early stored-program work as a disciplined way to turn sorting into smaller sorting problems plus a linear merge, establishing a pattern that remains fundamental to algorithm design.

Volker Strassen’s 1969 algorithm showed that ordinary cubic matrix multiplication was not asymptotically optimal, opening a long-running search for faster algebraic algorithms and changing complexity theory’s expectations.

Tony Hoare's Quicksort made partitioning the heart of sorting: rearrange data around a pivot, then solve two smaller sorting problems recursively in place.