Abstract
This note describes a sorting technique that is similar to the well-known “quicksort” method, but it is undirectional and avoids recursion. The new approach, which assumes that the keys to be sorted are positive numbers, leads to a much shorter program.
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. Reading, Mass.: Addison-Wesley, 1975 (second printing).
Robert Sedgewick,Quicksort. New York City: Garland Publishing Company, 1980.
Author information
Authors and Affiliations
Additional information
The preparation of this paper was supported in part by National Science Foundation grant DCR-83-00984. The authors thank the referees for several important suggestions.
Rights and permissions
About this article
Cite this article
Bing-Chao, H., Knuth, D.E. A one-way, stackless quicksort algorithm. BIT 26, 127–130 (1986). https://doi.org/10.1007/BF01939369
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01939369