News for hackers. Stuff that matters.
Re:Shortest Quicksort Ever? by 1331 on Monday June 13, 2011 @02:07AM (#2648282)
I got it down to 47 characters and improved the performance by moving the less common case to the bottom. (Not that is matters since this implementation sacrifices performance for elegance, but playing code golf with Haskell destroys the elegance anyway...)

  f=filter
  q(h:t)=q(f(<=h)t)++h:q(f(>h)t)
  q _=[]
Re:Shortest Quicksort Ever? by chamakits on Wednesday June 15, 2011 @01:52AM (#2656130)
totally stole your idea and found a way to do it in 46 characters :P

   f=filter
   q(h:t)= q(f(<=h)t)++h:q(f(>h)t)
   q a=a