Ruby Quicksort

gistfile1.rb

class QuickSort
	def recurse(low, high)
		i = low
		j = high

		pivot = @list[(low + (high-low)/2).floor]

		while i <= j
			while @list[i] < pivot
				i+=1
			end

			while @list[j] > pivot
				j-=1
			end

			if i <= j
				@list[i], @list[j] = @list[j], @list[i]
				i+=1
				j-=1
			end
		end

		if low < j
			recurse(low,j)
		end
		if i < high
			recurse(i,high)
		end
	end

	def sort(list)
		if list == nil || list.length <= 1
			return list
		end
		@list = list
		recurse(0,@list.length-1)
		@list
	end
end