Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
30
click to vote
FUN
2007
Springer
favorite
Email
discuss
report
169
views
Algorithms
»
more
FUN 2007
»
Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms
14 years 23 days ago
Download
www2.tcs.ifi.lmu.de
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.
Hermann Gruber, Markus Holzer, Oliver Ruepp
Real-time Traffic
Algorithms
|
Awful Algorithm Bogo-sort
|
Elementary Methods
|
FUN 2007
|
Perversely
|
claim paper
Related Content
»
Maximum likelihood analysis of algorithms and data structures
»
Cache Conscious Indexing for DecisionSupport in Main Memory
»
A search engine for natural language applications
more »
Post Info
More Details (n/a)
Added
19 Oct 2010
Updated
19 Oct 2010
Type
Conference
Year
2007
Where
FUN
Authors
Hermann Gruber, Markus Holzer, Oliver Ruepp
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision