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
ASCII Text
x 
 
Joseph JaJa, "A Perspective on Quicksort," Computing in Science and Engineering, vol. 2, no. 1, pp. 43-49, January/February, 2000.
 
 
BibTex
x
 
@article{ 10.1109/5992.814657,
author = {Joseph JaJa},
title = {A Perspective on Quicksort},
journal ={Computing in Science and Engineering},
volume = {2},
number = {1},
issn = {1521-9615},
year = {2000},
pages = {43-49},
doi = {http://doi.ieeecomputersociety.org/10.1109/5992.814657},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - Computing in Science and Engineering
TI - A Perspective on Quicksort
IS - 1
SN - 1521-9615
SP43
EP49
EPD - 43-49
A1 - Joseph JaJa,
PY - 2000
VL - 2
JA - Computing in Science and Engineering
ER -
 
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.