Re:Three Beautiful Quicksorts
by jmount on Thursday July 10, 2008 @09:05PM
(#243108)
It is beautiful code, but a lot more attention needs to be paid to the production quality version. In particular most beautiful quicksorts take O(n^2) time on a list filled with identical items (see Tim Peters ch. in the Python Cookbook or my article: http://www.win-vector.com/blog/2008/04/sorting-in-anger/
[ Parent
| on HN ]
There are no comments on this comment yet.