quicksort in scala

gistfile1.scala

def qs[T <% Ordered[T]](l: List[T]): List[T] = l match { 
  case Nil => Nil
  case (x :: xs) => {
    val (less,greater) = xs partition (_ <= x)
    qs(less) ++ (x :: qs(greater))
  }
}