Part I Computer Science

BIT Numerical Mathematics

, Volume 27, Issue 1, pp 44-48

First online:

A generalized, one-way, stackless quicksort

  • Lutz M. WegnerAffiliated withIBM Heidelberg Scientific Center

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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