[Scala][Haskell]quicksort

qsort.hs

qsort [] = []
qsort (n:xs) = qsort lt ++ [n] ++ qsort gteq where
    lt   = [x | x <- xs, x <  n]
    gteq = [x | x <- xs, x >= n]

qsort.scala

def qsort[A <% Ordered[A]](list: List[A]): List[A] = list match {
    case Nil => Nil
    case (n :: xs) => {
        val lt   = for (x <- xs if x <  n) yield x
        val gteq = for (x <- xs if x >= n) yield x
        qsort(lt) ++ List(n) ++ qsort(gteq)
    }
}

qsort(List(2,1,5,4,3))