|
|||||
|
|
A generalized,one-way,stackless quicksort |
|
| Authors: | Lutz M. Wegner |
| Affiliation: | (1) IBM Heidelberg Scientific Center, Tiergartenstrasse 15, D-6900 Heidelberg, Germany |
| 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). |
| Keywords: | C.R. F.2.2 |
| 本文献已被 SpringerLink 等数据库收录！ | |