Killer adversary for quicksort

Software - Practice and Experience

Volumn 29, Issue 4, 1999, Pages 341-344

  Mcilroy, M D ^a  

^a DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTATION THEORY; COMPUTER SOFTWARE;

ADVERSARY; PARTITION ELEMENT; PIVOT CHOICE; QUADRATIC BEHAVIOR; QUICKSORT; WORST CASE;

SORTING;

EID: 0032678572     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-024X(19990410)29:4<341::AID-SPE237>3.0.CO;2-R     Document Type: Article

References (3)

1. J. H. Kingston, Algorithms and Data Structures: Design, Correctness, Analysis, Addison-Wesley, 1990.
2. R. Sedgewick, Algorithms in C++, Addison-Wesley, 1992.
3. J. L. Bentley and M. D. McIlroy, 'Engineering a sort function', Software - Practice and Experience, 23,1249-1265 (1993).