* gabriele renzi <rff_rff / remove-yahoo.it> [Dec 16, 2004 10:30]:
> def qs(l)
>  return [] if (x,*xs=*l).empty?
>  less, more = xs.partition{|y| y < x}
>  qs(less) + [x] + qs(more)
> end

> algoritm suggestions are welcome :)

How about

def qs(l)
  l.sort!
end

;-),
	nikolai

-- 
::: name: Nikolai Weibull    :: aliases: pcp / lone-star / aka :::
::: born: Chicago, IL USA    :: loc atm: Gothenburg, Sweden    :::
::: page: www.pcppopper.org  :: fun atm: gf,lps,ruby,lisp,war3 :::
main(){printf(&linux["\021%six\012\0"],(linux)["have"]+"fun"-97);}