Functional-programming style Quicksort implementation written in Ruby, with no data mutation.

quicksort.rb

# Quicksort in Ruby
# Functional Programming style, with no data mutation.

# Jack Hooper 2014

def quicksort(list)
  return list if list.length <= 1
  higher, lower = list[1..-1].partition { |i| i > list.first }
  quicksort(lower) + [list.first] + quicksort(higher)
end