A generalized, one-way, stackless quicksort
Part I Computer Science
- Cite this article as:
- Wegner, L.M. BIT (1987) 27: 44. doi:10.1007/BF01937353
- 64 Downloads
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.05C.R. F.2.2
© BIT Foundations 1987