BIT Numerical Mathematics

, Volume 26, Issue 1, pp 127–130

A one-way, stackless quicksort algorithm

Authors

  • Huang Bing-Chao
    • Computer Science DepartmentStanford University
  • Donald E. Knuth
    • Computer Science DepartmentStanford University
Scientific Notes

DOI: 10.1007/BF01939369

Cite this article as:
Bing-Chao, H. & Knuth, D.E. BIT (1986) 26: 127. doi:10.1007/BF01939369

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.

Download to read the full article text

Copyright information

© BIT Foundations 1986