Hacker News Reader

Comment by jaybosamiya | Hacker News Reader

Not specifically "software" but this piece of Haskell code is the most beautiful code I've ever seen:

    quicksort [] = []
    quicksort (x:xs) = quicksort [y|y<-xs,y<x] ++ [x] ++ quicksort [y|y<-xs,y>=x]

View on HN

The recursive Fibonacci definition in Haskell is far more beautiful IMO. But there's always more beautiful one-line snippets (like the regex that can tell you if a number is prime).

fibs = 0 : 1 : zipWith (+) fibs (tail fibs)

Will you still think that when you realize it isn't actually a quicksort?

It's tree sort. It does the same comparisons as quicksort, but organizes its data differently.

It's nifty, but not an especially beautiful use of Haskell.

Okasaki's Red-Black Trees rendered in Haskell are nicer, for example.

Reply on news.ycombinator.com