A generalized, one-way, stackless quicksort
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 mininal space in O(N log N) average time.
scientific article; zbMATH DE number 4026842
scientific article