QuickSort in Scala

quicksort.scala

object QS {
  def quickSort(xs: Array[Int]): Array[Int] = {
    if (xs.length < 2) xs
    else {
      val pivot = xs(xs.length/2)
      val less = xs.filter(n => n < pivot)
      val greater = xs.filter(n => n > pivot)
      quickSort(less) ++ Array(pivot) ++ quickSort(greater) 
    }
  }
}

val r = scala.util.Random
val randomArray = (for (i <- 1 to 1000) yield r.nextInt(1000)).toArray

println(QS.quickSort(randomArray).mkString)