这有多大改进？

gistfile1.scala

def qsort[T <% Ordered[T]](list:List[T]):List[T] = {
  list.match({
    case Nil => Nil;
    case x::xs =>
       val (before,after) = xs.partition({ i => i.<(x) });
       qsort(before).++(qsort(after).::(x)));
  });
}

def qsort[T <% Ordered[T]](list:List[T]):List[T] = list match {
    case Nil => Nil
    case x :: xs =>
       val (before, after) = xs partition ( _ < x )
       qsort(before) ++ (x :: qsort(after));
}

看来还是略有改进。。。