News for hackers. Stuff that matters.
Re:Trying Haskell by jmillikin on Sunday April 10, 2011 @11:57AM (#2429693)
Haskell has mutable data structures; you could easily implement in-place quicksort with vectors, arrays, or pointers.

There are no comments on this comment yet.