Abstract
This note generalizes the one-way, stackless quicksort of Huang and Knuth to work for any type of sort key. It thus proves that quicksort can run with minimal space inO(N logN) average time.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. A. R. Hoare,Quicksort, The Computer Journal, 5 (1962), 10–15.
Donald E. Knuth,The Art of Computer Programming, Volume 3:Sorting and Searching, Readings, Mass.: Addison-Wesley, 1975.
D. Motzkin,A stable quicksort, Softw.Pract. Exper. 11, 6 (June 1981), 607–611.
L. M. Wegner,Sorting a linked list with equal keys, Inf. Processing Lett., 15, 5 (Dec. 1982), 205–208.
L. M. Wegner,Quicksort for equal keys, IEEE TC, 34, 4 (April 1985), 362–367.
Huang Bing-Chao and Donald E. Knuth,A one-way, stackless quicksort algorithm, BIT, 26 (1986), 127–130.
J. Bentley,Programming pearls: How to sort, Comm. ACM, 27, 4 (April 1984), 287–291.
R. Sedgewick,Implementing quicksort programs, Comm. ACM, 21, 10 (Oct. 1978), 847–857 and 22, 6 (June 1979), 368.
L. Trabb Pardo,Stable sorting and merging with optimal space and time bounds, SIAM J. Comput., 6, 2 (June 1977), 351–372.
S. M. Merritt,An inverted taxonomy of sorting algorithms, Comm. ACM, 28, 1 (Jan. 1985), 96–99.
Author information
Authors and Affiliations
Additional information
On leave from FH Fulda, D-6400 Fulda (Germany).