gistfile1.txt

object Sort {
  def qsort[A, CC[A] <: TraversableLike[A, CC[A]]](c: CC[A])(implicit ord : Ordering[A], bf: CanBuildFrom[CC[A], A, CC[A]]) : CC[A] = {
    if (c.isEmpty || c.tail.isEmpty) c
    else {
      val pivot = c.head
      val (low: CC[A], high: CC[A]) = c.tail.partition{ ord.lt(_, pivot) }
      qsort(low) ++ bf().+=(pivot).result ++ qsort(high)
    }
  }
}