Just another update

Task/Sorting-algorithms-Quicksort/Scala/sorting-algorithms-quicksort-5.scala

@@ -1,6 +1,7 @@
 def quicksortInt(list: List[Int]): List[Int] = list match {
+    case List(head) => list
     case head :: tail =>
       val (smaller, bigger) = tail partition (_ < head)
       quicksortInt(smaller) ::: head :: quicksortInt(bigger)
-    case list => list
+    case _ => list
   }