01
J. W. J. Williams, Robert Floyd, and the Heap Behind Heapsort
Heapsort joined a compact tree-shaped data structure with an in-place sorting procedure. Williams introduced the core idea in 1964, and Floyd quickly supplied an efficient construction and implementation pattern close to the one still taught today.
↗