Sorting the slow way: An analysis of perversely awful randomized sorting algorithms

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

Volumn 4475 LNCS, Issue , 2007, Pages 183-197

  Gruber, Hermann ^a   Holzer, Markus ^b   Ruepp, Oliver ^b  

^a UNIVERSITY OF MUNICH   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ELEMENTARY METHODS; RANDOMIZED SORTING ALGORITHMS;

SORTING;

EID: 38049017983     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72914-3_17     Document Type: Conference Paper

References (7)

1. Biedl, T., Chan, T., Demaine, E.D., Fleischer, R., Golin, M., King, J.A., Munro, J.I.: Fun-sort - or the chaos of unordered binary search. Discrete Applied Mathematics 144(3), 231-236 (2004)
2. Broder, A., Stolfi, J.: Pessimal algorithms and simplexity analysis. SIGACT News 16(3), 49-53 (1984)
3. Flatto, L., Odlyzko, A.M., Wales, D.B.: Random shuffles and group presentations. Annals of Probability 13(1), 154-178 (1985)
4. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addison-Wesley, London (1994)
5. Knuth, D.E.: Seminumerical Algorithms, The Art of Computer Programming, vol. 2. Addison-Wesley, London (1981)
6. Walt Disney's Mary Poppins. VHS Video Cassette, [Walt Disney Home Video 023-5] (1980)
7. Raymond, E.S.: The New Hacker's Dictionary. MIT Press, Cambridge (1996)