Ruby quicksort

gistfile1.rb

#!/usr/bin/env ruby

data = Array.new
50.times { data << rand(100) }

def qs(list)
    return list if list.length < 2
    smaller, bigger = list[1..-1].partition {|x| x < list[0] }
    return qs(smaller) + [list[0]] + qs(bigger)
end

puts qs(data).inspect