On Tuesday, February 14, 2012 13:02:43 James Miller wrote: > On 14 February 2012 12:45, Ali Çehreli <acehr...@yahoo.com> wrote: > > On 02/13/2012 03:34 PM, James Miller wrote: > >> Saying "it is not quicksort as much as it may conceptually resemble > >> quicksort" is kinda odd, its like saying "it is not a car, as much as > >> it may conceptually resemble a car" because it doesn't run on petrol > >> or gas, but instead runs on environment destroying orphan tears. > > > > For what its worth, Andrei uses that argument in his "On Iteration" > > article with "For starters, [one implementation of Haskell's] qsort is > > not really quicksort. Quicksort, as defined by Hoare in his seminal > > paper [8], is an in-place algorithm." > > > > http://www.informit.com/articles/printerfriendly.aspx?p=1407357 > > > > Ali > > Fair enough, I didn't realise that Quicksort was defined as in place, > in that case, I retract my opposition to "not really a quicksort" > however my "missing the point" still stands. I still prefer arrays > over S-lists anyway, how else do I efficiently implement a heap?
Orphan tears. It's the only way to go. - Jonathan M Davis