News for hackers. Stuff that matters.
Re:Trying Haskell by stianan on Sunday April 10, 2011 @11:34AM (#2429632)
Not only is it not proper quicksort, it's very memory inefficient.
Re:Trying Haskell by eru on Sunday April 10, 2011 @12:49PM (#2429822)
Depends on your GC and compiler.
Re:Trying Haskell by stianan on Sunday April 10, 2011 @03:08PM (#2430139)
I'd argue that it's a good thing to use an algorithm that is efficient in and of itself. (And perhaps a language which invites the use of such an algorithm.)
Re:Trying Haskell by eru on Monday April 11, 2011 @04:41PM (#2434261)
The efficiency of algorithms depends on the language / model of computation you are using.

For an extreme example, the best way to write an efficient matrix multiplication in Fortran is to write a naive matrix multiplication. The compiler will recognize the pattern, and transform it.