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

  • Hermann Gruber
  • Markus Holzer
  • Oliver Ruepp
Conference paper

DOI: 10.1007/978-3-540-72914-3_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4475)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Hermann Gruber
    • 1
  • Markus Holzer
    • 2
  • Oliver Ruepp
    • 2
  1. 1.Institut für Informatik, Ludwig-Maximilians-Universität München, Oettingenstraße 67, D-80538 MünchenGermany
  2. 2.Institut für Informatik, Technische Universität München, Boltzmannstraße 3, D-85748 Garching bei MünchenGermany

Personalised recommendations