Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fun with Algorithms

FUN 2007: Fun with Algorithms pp 183–197Cite as

Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4475))

Abstract

This paper is devoted to the “Discovery of Slowness.” The archetypical perversely awful algorithm bogo-sort, which is sometimes referred to as Monkey-sort, is analyzed with elementary methods. Moreover, practical experiments are performed.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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)

    Article  MathSciNet  MATH  Google Scholar 

  2. Broder, A., Stolfi, J.: Pessimal algorithms and simplexity analysis. SIGACT News 16(3), 49–53 (1984)

    Article  Google Scholar 

  3. Flatto, L., Odlyzko, A.M., Wales, D.B.: Random shuffles and group presentations. Annals of Probability 13(1), 154–178 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  4. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addison-Wesley, London (1994)

    MATH  Google Scholar 

  5. Knuth, D.E.: Seminumerical Algorithms, The Art of Computer Programming, vol. 2. Addison-Wesley, London (1981)

    MATH  Google Scholar 

  6. Walt Disney’s Mary Poppins. VHS Video Cassette, [Walt Disney Home Video 023-5] (1980)

    Google Scholar 

  7. Raymond, E.S.: The New Hacker’s Dictionary. MIT Press, Cambridge (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Ludwig-Maximilians-Universität München, Oettingenstraße 67, D-80538 München, Germany

    Hermann Gruber

  2. Institut für Informatik, Technische Universität München, Boltzmannstraße 3, D-85748 Garching bei München, Germany

    Markus Holzer & Oliver Ruepp

Authors
  1. Hermann Gruber
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus Holzer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Oliver Ruepp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Sistemi e Informatica, Università degli Studi di Firenze, Viale Morgagni 65, 50134, Firenze, Italy

    Pierluigi Crescenzi

  2. Dipartimento di Informatica, Università degli Studi di Pisa, Largo Bruno Pontecorvo 3, 56127, Pisa, Italy

    Giuseppe Prencipe

  3. Dipartimento di Ingegneria dell’Informazione, Università degli Studi di Padova, Via Gradenigo 6/B, 35131, Padova, Italy

    Geppino Pucci

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Gruber, H., Holzer, M., Ruepp, O. (2007). Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. In: Crescenzi, P., Prencipe, G., Pucci, G. (eds) Fun with Algorithms. FUN 2007. Lecture Notes in Computer Science, vol 4475. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72914-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72914-3_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72913-6

  • Online ISBN: 978-3-540-72914-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation