论文信息 - A generalized, one-way, stackless quicksort

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 minimal space inO(N logN) average time.

Lutz M. Wegner

[1] Susan M. Merritt,et al. An inverted taxonomy of sorting algorithms , 1985, CACM.

[2] Dalia Motzkin,et al. A stable quicksort , 1981, Softw. Pract. Exp..

[3] Donald E. Knuth,et al. A one-way, stackless quicksort algorithm , 1986 .

[4] Robert Sedgewick,et al. Implementing Quicksort programs , 1978, CACM.

[5] Jon Bentley,et al. Programming pearls: how to sort , 1984, CACM.

[6] Lutz M. Wegner. Quicksort for Equal Keys , 1985, IEEE Transactions on Computers.

[7] Luis Trabb Pardo. Stable Sorting and Merging with Optimal Space and Time Bounds , 1977, SIAM J. Comput..

[8] Lutz M. WEGNER. Sorting a Linked List with Equal Keys , 1982, Inf. Process. Lett..