A generalized, one-way, stackless quicksort (Q1094881)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A generalized, one-way, stackless quicksort |
scientific article; zbMATH DE number 4026842
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalized, one-way, stackless quicksort |
scientific article; zbMATH DE number 4026842 |
Statements
A generalized, one-way, stackless quicksort (English)
0 references
1987
0 references
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.
0 references
stackless quicksort
0 references
0.9632495
0 references
0 references
0.8632024
0 references
0 references
0.8541573
0 references
