This needs to be presented at Fun With Algorithms [1]. Also somewhat related is the bogosort algorithm [2] which was designed to be awfully slow (average case p

This needs to be presented at Fun With Algorithms [1]. Also somewhat related is the bogosort algorithm [2] which was designed to be awfully slow (average case performance O(n * n!)). [1] http://fun2010.dia.unisa.it/ http://fun2010.dia.unisa.it/ [2] http://www.tcs.ifi.lmu.de/~gruberh/data/fun07-final.pdf http://www.tcs.ifi.lmu.de/~gruberh/data/fun07-final.pdf (pdf)