News for hackers. Stuff that matters.

A comment on Quicksort is the new Hello World. Parent comment

Re:Quicksort is the new Hello World by sizzla on Saturday December 11, 2010 @02:06PM (#1995420)
This looks like yet another Haskell "variant." From what I can tell this sort does not occur in place and thus would not make a particularly good quicksort. Memory use, number of accesses per element, etc. This style of programming is more suitable for heapsort or maybe mergesort.
[ Parent | on HN ]
Re:Quicksort is the new Hello World by zbanks on Saturday December 11, 2010 @03:43PM (#1995617)
You can't exactly sort "in place" in functional languages like F#/Haskell... at least trivially.
[ Parent | on HN ]
Re:Quicksort is the new Hello World by fleitz on Sunday December 12, 2010 @01:02AM (#1996592)
Given the level of abstraction in most modern programing languages/ operating systems it's really hard to say that any modern language could implement quicksort in the most strict definitions.

For example, is a quicksort 'in-place' if your memory gets swapped to disk?

[ Parent | on HN ]