BIT Numerical Mathematics

, Volume 26, Issue 1, pp 127–130 | Cite as

A one-way, stackless quicksort algorithm

  • Huang Bing-Chao
  • Donald E. Knuth
Scientific Notes

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    C. A. R. Hoare,Quicksort, The Computer Journal 5 (1962), 10–15.CrossRefGoogle Scholar
  2. 2.
    Donald E. Knuth,The Art of Computer Programming, Volume 3:Sorting and Searching. Reading, Mass.: Addison-Wesley, 1975 (second printing).Google Scholar
  3. 3.
    Robert Sedgewick,Quicksort. New York City: Garland Publishing Company, 1980.Google Scholar

Copyright information

© BIT Foundations 1986

Authors and Affiliations

  • Huang Bing-Chao
    • 1
  • Donald E. Knuth
    • 1
  1. 1.Computer Science DepartmentStanford UniversityStanfordUSA

Personalised recommendations