#
# QuickSort in Ruby
# von Michael Neumann
# 

def quicksort(arr)
   return arr if arr.length <= 1
   m = arr[0]
   quicksort(arr.select {|i| i<m}) + arr.select {|i| i==m} + quicksort(arr.select {|i| i>m})
end


# Aufruf
print quicksort([5,99,2,45,12,234,29,0]).join(" ")