A generalized, one-way, stackless quicksort (Q1094881): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:29, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalized, one-way, stackless quicksort |
scientific article |
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
