quicksort.scala

class QuickSorter[T <% Ordered[T]] {
	def sort(list: List[T]) : List[T] = {
		list match {
			case Nil => Nil
			case pivot :: rest =>
				val (smaller, higher) = rest.partition(_ < pivot)
				sort(smaller) ++ (pivot :: sort(higher))
		}
	}
}