O-I/README.md

## README.md

      
    Raw
  

              README.md
            
          
    Quicksort

This is an implementation of the quicksort algorithm written in Ruby. Basically, the same code you'll find on Wikibook's entry for quicksort implementations. A gem from the 'Book'.

  
## quicksort.rb
def quicksort(list)
  return list if list.length < 2
  pivot = list.shift
  left, right = list.partition { |el| el < pivot }
  quicksort(left) + [pivot] + quicksort(right)
end
	def quicksort(list)
	return list if list.length < 2
	pivot = list.shift
	left, right = list.partition { \|el\| el < pivot }
	quicksort(left) + [pivot] + quicksort(right)
	end