June 2018 Update

Task/Sorting-algorithms-Quicksort/Kotlin/sorting-algorithms-quicksort-2.kotlin

@@ -1,11 +1,10 @@
-fun quicksort(list: List<Int>): List<Int> {
+fun <T : Comparable<T>> quicksort(list: List<T>): List<T> {
     if (list.isEmpty()) return emptyList()
 
     val head = list.first()
     val tail = list.takeLast(list.size - 1)
 
-    val less = quicksort(tail.filter { it < head })
-    val high = quicksort(tail.filter { it >= head })
+    val (less, high) = tail.partition { it < head }
 
     return less + head + high
 }