# Merge Sort & Divide-and-Conquer

**Track:** Objects, Data Structures & Algorithms — Creative Coding — the existing 50
**Framework / surface:** p5.js
**Level:** Advanced
**Prerequisites:** Selection Sort Visualized, Functions & Modularity

**In one line:** Split, sort the halves, merge them back — the fast sort.

## Theory, aesthetics & inspiration

Merge sort embodies divide-and-conquer: split the array in half, sort each half recursively, then merge the two ordered runs into one. Attributed to John von Neumann in 1945, it achieves n-log-n time and is examined closely in the third volume of Donald Knuth's "The Art of Computer Programming." The structural beauty is recursive self-similarity—the same procedure applied at every scale until the base case of a single element—and the merge step, which interleaves two sorted streams in a single pass. Visualized, the recursion descends and reassembles; rendered as sound in Timo Bingmann's "The Sound of Sorting," the rebuilding of order becomes audible.