A Perspective on Quicksort

Computing in Science and Engineering

Volumn 2, Issue 1, 2000, Pages

  Jaja, Joseph ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002305544     PISSN: 15219615     EISSN: None     Source Type: Journal    
DOI: 10.1109/5992.814657     Document Type: Article

References (9)

1. C.A.R. Hoare, "Quicksort," The Computer J., Vol. 5, No. 1, Apr. 1962, pp. 10-15.
2. D. Helman, D. Bader, and J. JaJa, "A Randomized Parallel Sorting Algorithm with an Experimental Study," J. Parallel and Distributed Computing, Vol. 52, No. 1, 10 July 1998, pp.1-23.
3. D.E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, Mass., 1973.
4. R. Sedgewick, "Implementing Quicksort Programs," Comm. ACM, Vol. 21, No. 10, Oct. 1978, pp. 847-857.
5. M. Ben-Or, "Lower Bounds for Algebraic Computation Trees," Proc. 15th Ann. ACM Symp. Theory of Computing, ACM Press, New York, 1983, pp. 80-86.
6. P. Raghaven, Lecture Notes on Randomized Algorithms, tech. report, IBM Research Division, Yorktown Heights, N.Y., 1990.
7. W. Frazer and A. Mckellar, "Samplesort: A Sampling Approach to Minimal Storage Tree Sorting," J. ACM, Vol. 17, No. 3, July 1970, pp. 496-507.
8. G. Blelloch et al., "A Comparison of Sorting Algorithms for the Connection Machine CM-2," Proc. ACM Symp. Parallel Algorithms and Architectures, ACM Press, New York, 1991, pp. 3-16.
9. K. Mulmuley, Computational Geometry: An Introduction through Randomized Algorithms, Prentice Hall, Upper Saddle River, N.J., 1994.