BIT Numerical Mathematics

, Volume 27, Issue 1, pp 44–48

A generalized, one-way, stackless quicksort

Authors

  • Lutz M. Wegner
    • IBM Heidelberg Scientific Center
Part I Computer Science

DOI: 10.1007/BF01937353

Cite this article as:
Wegner, L.M. BIT (1987) 27: 44. doi:10.1007/BF01937353

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.

AMS 68.E.05

C.R.F.2.2

Copyright information

© BIT Foundations 1987