@tedu Pretty sure I ended up with O(n^3) by legitimate laziness.

I've had O(n!) and O(n^n) but those were combinatorial problems where there legitimately might not be a faster way. 

 @tedu Sadly, bogosort() is only O(n!) (deck of cards, scrambled; throw them in the air, are they sorted? If not, loop).