Issue No. 01 - January/February (2000 vol. 2)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/5992.814657
This article introduces the basic Quicksort algorithm and gives a flavor of the richness of its complexity analysis. The author also provides a glimpse of some of its generalizations to parallel algorithms and computational geometry.
J. JaJa, "A Perspective on Quicksort," in Computing in Science & Engineering, vol. 2, no. , pp. 43-49, 2000.