1962: Tony Hoare of Elliott Brothers, Ltd., London, presents Quicksort.
   Putting N things in numerical or alphabetical order is mind-numbingly mundane. The intellectual challenge lies in devising ways
of doing so quickly. Hoare’s algorithm uses the age-old recursive strategy of divide and conquer to solve the problem: Pick one
element as a “pivot,” separate the rest into piles of “big” and “small” elements (as compared with the pivot), and then repeat this
procedure on each pile. Although it’s possible to get stuck doing all N(N – 1)/2 comparisons (especially if you use as your pivot the first
item on a list that’s already sorted!), Quicksort runs on average with O(N log N) efficiency. Its elegant simplicity has made Quicksort
the pos-terchild of computational complexity.