Implementing Quicksort Programs

Communications of the ACM

Volumn 21, Issue 10, 1978, Pages 847-857

  Sedgewick, Robert ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

analysis of algorithms; code optimization; Quicksort; sorting

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING;

EID: 0018021159     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/359619.359631     Document Type: Article

References (29)

1. Boothroyd, J. Sort of a section of the elements of an array by determining the rank of each element: Algorithm 25; and Ordering the subscripts of an array section according to the magnitudes of the elements: Algorithm 26.Compir. J. 10 (Nov. 1967), 308-310.
2. R.S. Scowen in Comptr. J. 12 (Nov. 1969), 408-409.
3. A. D. Woodall in Comptr. J. 13 (Aug. 1970.
4. Brawn, B.S., Gustavson, F.G., and Mankin, E. Sorting in a paging environment. Comm. ACM 13, 8 (Aug. 1970), 483-494.
5. Cocke, J., and Schwartz, J.T. Programming languages and their compilers. Preliminary Notes. Courant Inst, of Math. Sciences, New York U., New York, 1970.
6. Frazer, W.D., and McKellar, A. C. Samplesort: A sampling approach to minimal storage tree sorting. J. ACM 17, 3 (July 1970), 496-507.
7. Hoare, C.A.R. Partition: Algorithm 63; Quicksort: Algorithm 64. Find: Algorithm 65. Comm. ACM 4, 7 (July 1961), 321-322.
8. J. S. Hillmore in Comm. ACM 5, 8 (Aug. 1962), 439.
9. B. Randell and L.J. Russell in Comm. ACM 6, 8 (Aug. 1963), 446.).
10. Hoare, C.A.R. Quicksort. Computer J. 5, 4 (April 1962), 10-15.
11. Knuth, D.E. The Art of Computer Programming, Vol. 1:Fundamental Algorithms. Addison-Wesley, Mass., 1968.
12. Knuth, D. E. The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. Addison-Wesley, Mass., 1969.
13. Knuth, D.E. The Art of Computer Programming, Vol. 3: Sortin and Searching. Addison-Wesley, Mass., 1972.
14. Knuth, D. E. Structured programming with go to statements. Computing Surveys 6, 4 (Dec. 1974), 261-301.
15. Loeser, R. Some performance tests of “quicksort” and descendants. Comm. ACM 17, 3 (March 1974), 143-152.
16. Morris, R. Some theorems on sorting. SIAM J. Appl. Math. 17, 1 (Jan. 1969), 1-6.
17. Rich, R. P. Internal Sorting Methods Illustrated with PL/I Progams. Prentice-Hall, Englewood Cliffs, N.J., 1972.
18. Scowen, R. S. Quickersort: Algorithm 271. Comm. ACM 8, 11 (Nov. 1965), 669-670.
19. C. R. Blair in Comm; ACM 9, 5 (May 1966), 354.
20. Sedgewick, R. Quicksort. Ph. D. Th. Stanford Comptr. Sci. Rep STAN-CS-75-492, Stanford U., Stanford, Calif., May 1975.
21. Sedgewick, R. Quicksort with equal keys. Siam J. Comput. 6, (June 1977), 240-287.
22. Sedgewick, R. The analysis of Quicksort programs. Acta Informatica 7 (1977), 327-355.
23. Singleton, R. C. An efficient algorithm for sorting with minimi storage: Algorithm 347. Comm. ACM 12, 3 (March 1969), 185-187.
24. R. Griffin and K. A. Redish in Comm. ACM 13, 1 (Jan. 1970), 54.
25. R. Peto, Comm. ACM 13, 10 (Oct. 1970), 624.
26. Stone, H. S. Sorting on STAR. IEEE Trans. Software Eng. St (Mar. 1978), 138-146.
27. van Emden, M. N. Increasing the efficiency of quicksort: Algorithm 402. Comm. ACM 13, 11 (Nov. 1970), 693-694.
28. van Emden, M. N. Comm. ACM 13, 9 (Sept. 1970), 563-567.
29. Wirth, N. Algorithms + Data Structures = Programs. Prentice-Hall, Englewood Cliffs, N.J., 1976.