This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Perspective on Quicksort
January/February 2000 (vol. 2 no. 1)
pp. 43-49
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.
Citation:
Joseph JaJa, "A Perspective on Quicksort," Computing in Science and Engineering, vol. 2, no. 1, pp. 43-49, Jan.-Feb. 2000, doi:10.1109/5992.814657
Usage of this product signifies your acceptance of the Terms of Use.