Implementing Quicksort Programs

This paper is a practical study of how to
implement the Quicksort sorting algorithm and its 
best variants on real computers, including how to apply
various code optimization techniques.  A detailed 
implementation combining the most effective improvements
to Quicksort is given, along with a discussion 
of how to implement it in assembly language.  Analytic
results describing the performance of the programs 
are summarized.  A variety of special situations are considered
from a practical standpoint to illustrate 
Quicksort's wide applicability as an internal sorting
method which requires negligible extra storage. 

CACM October, 1978

Sedgewick, R.

Quicksort, analysis of algorithms, code optimization, sorting

4.0 4.6 5.25 5.31 5.5

CA781007 DH January 29, 1979  5:40 PM

1175	4	3054
1919	4	3054
1919	4	3054
1919	4	3054
1969	4	3054
1969	4	3054
1997	4	3054
1997	4	3054
2118	4	3054
2191	4	3054
2191	4	3054
2216	4	3054
2216	4	3054
2216	4	3054
2227	4	3054
2319	4	3054
2388	4	3054
2388	4	3054
2348	4	3054
2582	4	3054
2669	4	3054
2679	4	3054
2679	4	3054
2679	4	3054
2679	4	3054
2783	4	3054
2783	4	3054
2784	4	3054
3054	4	3054
3054	4	3054
3054	4	3054
3054	4	3054
3054	4	3054
3054	4	3054
3054	4	3054
3054	4	3054
3054	4	3054
3054	4	3054
3054	4	3054
3054	4	3054
3121	4	3054
3121	4	3054
864	4	3054
1175	5	3054
1880	5	3054
1919	5	3054
1969	5	3054
1980	5	3054
1997	5	3054
307	5	3054
308	5	3054
309	5	3054
2017	5	3054
2679	5	3054
3054	5	3054
3054	5	3054
3054	5	3054
776	5	3054