Sorting Algorithms, via The Daily WTF. This goes along with my post on Gnome sort.
Even though you know what sorts are O(n²) and which are O(nlogn), you don't have an intuitive feel for the constants involved, so the graphs are helpful. I wish he'd done an analysis of Gnome sort. I'd be really interested to see where it falls on the graph of O(n²) algorithms.
Feel free to post a comment below. Please see my comment policy.
Formatting Rules (No HTML):