title: Are there any worse sorting algorithms than Bogosort (a.k.a Monkey Sort)?
body: <p>My co-workers took me back in time to my University days with a discussion of sorting algorithms this morning.  We reminisced about our favorites like <a href="http://en.wikipedia.org/wiki/Gnome_sort" rel="noreferrer">StupidSort</a>, and one of us was sure we had seen a sort algorithm that was <code>O(n!)</code>.  That got me started looking around for the "worst" sorting algorithms I could find.</p>
  
  <p>We postulated that a completely random sort would be pretty bad (i.e. randomize the elements - is it in order?  no?  randomize again), and I looked around and found out that it's apparently called <a href="http://en.wikipedia.org/wiki/Bogosort" rel="noreferrer">BogoSort, or Monkey Sort, or sometimes just Random Sort</a>.</p>
  
  <p>Monkey Sort appears to have a worst case performance of <code>O(∞)</code>, a best case performance of <code>O(n)</code>, and an average performance of <code>O(n·n!)</code>.</p>
  
  <p>What is the currently official accepted sorting algorithm with the worst average sorting performance (and there fore beeing worse than <code>O(n·n!)</code>)?</p>