Optimal sampling strategies in quicksort

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1443 LNCS, Issue , 1998, Pages 327-338

  Martinez, Conrado ^a   Roura, Salvador ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONSTANT FACTORS; FINDING ALGORITHM; OPTIMAL SAMPLES; OPTIMAL SAMPLING; QUICKSORT;

AUTOMATA THEORY;

EID: 0009703834     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055064     Document Type: Conference Paper

References (11)

1. R.W. Floyd and R.L. Rivest. Expected time bounds for selection. Communications of the ACM, 18:165-173, 1975.
2. C.A.R. Hoare. FIND (Algorithm 65). Communications of the ACM, 4:321-322, 1961.
3. C.A.R. Hoare. Quicksort. Computer Journal, 5:10-15, 1962.
4. D.E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison-Wesley, 1973.
5. C. Martinez and S. Roura. Optimal sampling strategies in quicksort and quickselect. Technical Report LSI-98-1-R, LSI-UPC, 1998. Also available from http://www.lsi.upc.es/dept/techreps/1998.html.
6. C.C. McGeoch and J.D. Tygar. Optimal sampling strategies for quicksort. Random Structures & Algorithms, 7:287-300, 1995.
7. S. Roura. An improved master theorem for divide-and-conquer recurrences. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proc. of the 24th Int. Colloquium on Automata, Languages and Programming (ICALP'97), volume 1256 of Lecture Notes in Computer Science. Springer, 1997.
8. R. Sedgewick. Quicksort. Garland, 1978.
9. R. Sedgewick. Algorithms in C, volume 1. Addison-Wesley, 3rd edition, 1997.
10. R.C. Singleton. Algorithm 347: An efficient algorithm for sorting with minimal storage. Communications of the ACM, 12:185-187, 1969.
11. M.H. van Emden. Increasing the efficiency of quicksort. Communications of the ACM, 13:563-567, 1970.