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

Authors:
Hermann Gruber;Markus Holzer;Oliver Ruepp
Affiliations:
Institut für Informatik, Ludwig-Maximilians-Universität München, München, Germany;Institut für Informatik, Technische Universität München, Garching bei München, Germany;Institut für Informatik, Technische Universität München, Garching bei München, Germany
Venue:
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Year:
2007

Citing 5
Cited 0

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The New Hacker's Dictionary

The New Hacker's Dictionary
Concrete Math

Concrete Math
Pessimal algorithms and simplexity analysis

ACM SIGACT News
Fun-sort--or the chaos of unordered binary search

Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)

Quantified Score

Hi-index	0.00

Visualization

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.