Recursive QuickSort

QuickSort.scala

object QuickSort extends App {
  val list = List(3, 5, 7, 1, 4, 9, 44, 2)
  println(quickSort(list))

  def quickSort(list: List[Int]): List[Int] = {
    list match {
      case Nil => Nil
      case pivot :: tail =>
        val (less, greater) = tail.partition(_ < pivot)
        quickSort(less) ::: pivot :: quickSort(greater)
    }
  }
}