Generic Quick Sort in Scala

quick-sort.scala

def quickSort[T](list: List[T])(implicit o: Ordering[T]): List[T] =
  list match {
    case Nil => Nil
    case (head :: tail) =>
      // select head as the pivot point
      val pivot = head
      val (lessThanPivot, greaterThanPivot) = tail.partition(e => o.lteq(pivot, e))
      quickSort(lessThanPivot) ::: pivot :: quickSort(greaterThanPivot)
  }

Thanks, was looking for a nice implementation of quicksort in scala to compare to the classic Haskell version. Now I just need to work out how to make it tail recursive...