Link Details

Recently there was a post on eigenclass that was picked up by programming.reddit wherein the author performed an analysis of the classic Haskell quicksort example and tried to reverse the folklore understanding that as classically implemented the quicksort used by most Haskell programmers has an n^2 average case performance. Bowing to Lennart's biases I'll admit the Haskell quicksort is not exactly the same thing and refer to it as "quicksort" in somewhat patronizing quotes hereafter.