yannick-cw · June 2, 2020 07:41
diff --git a/Algos.worksheet.sc b/Algos.worksheet.sc
 import Ordering.Implicits._

 def quicksort[A: Ordering](l: List[A]): List[A] = l match {
  case x :: (xs @ (y :: z)) =>
    val (smallerEq, greater) = xs.partition(_ <= x)
    quicksort(smallerEq) ++ List(x) ++ quicksort(greater)
  case base => base
 }
	import Ordering.Implicits._

	def quicksort[A: Ordering](l: List[A]): List[A] = l match {
	case x :: (xs @ (y :: z)) =>
	val (smallerEq, greater) = xs.partition(_ <= x)
	quicksort(smallerEq) ++ List(x) ++ quicksort(greater)
	case base => base
	}