http://thedailywtf.com/archive/2004/10/13/2557.aspx#2559, no DailyWTF, par briesmīgu sortēšanas implementāciju ( O(n^n) ):

re: HowBigIsMyCallStackSort() 10/13/2004 3:21 PM chris

I admit to having done worse. I would state that it does not matter. Moreover, Big-O notation is important but does not take into account the bussiness-world-centric rules of development time vs runtime. If you know your datasets are smallish, a quick hack search with little development time is always better than a well thought out search that takes even just an hour or so longer.

This is precisely why I left the world of business applications.