quickSort

fun <T : Comparable<T>> quickSort(list: MutableList<T>, low: Int = 0, high: Int = list.size - 1)

Inventor: Tony Hoare Worst complexity: n^2 Average complexity: nlog(n) Best complexity: nlog(n) Method: Partitioning Stable: No