Title :
A perspective on Quicksort
Author_Institution :
Inst. for Adv. Comput. Studies, Maryland Univ., College Park, MD, USA
Abstract :
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
Keywords :
computational complexity; computational geometry; parallel algorithms; sorting; Quicksort algorithm; complexity analysis; computational geometry; parallel algorithms; Algorithm design and analysis; Application software; Computational geometry; Computer science; Parallel algorithms; Parallel machines; Partitioning algorithms; Sorting;
Journal_Title :
Computing in Science & Engineering
DOI :
10.1109/5992.814657
