clean_qsort.scala

def split[A <% Ordered[A]](list: List[A], p: A): (List[A], List[A]) = list match {
  case e :: rest => 
    val (left, right) = split(rest, p)
    if (e < p)
	  (e :: left, right)
	else
	  (left, e :: right)
  case _ => (Nil, Nil)
}

def qsort[A <% Ordered[A]](list: List[A]): List[A] = list match {
  case p :: rest =>
    val (left, right) = split(rest, p)
    qsort(left) ++ (p :: qsort(right))
  case _ => Nil
}

println(qsort(List(1241, 1, 234, 503, 122, 99, 10, 1992, 1200)))
println(qsort("quicksort".toList))