def sort(xs: List[Int]): List[Int] =
  if (xs.length <= 1) xs
  else {
    val pivot = xs(xs.length / 2)
    sort(xs filter (_ < pivot)) ::: (xs filter (_ == pivot)) ::: sort(xs filter (_ > pivot))
  }

Quicksort

Julien Wetterwald (2)

Tags: sorting (1)