, Volume 27, Issue 1, pp 44-48

A generalized, one-way, stackless quicksort

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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.

On leave from FH Fulda, D-6400 Fulda (Germany).