dataStructuresAndAlgorithms/dev.funkymuse.datastructuresandalgorithms.sort/insertionSort

insertionSort

fun <T : Comparable<T>> insertionSort(list: MutableList<T>)

Worst complexity: n^2 Average complexity: n^2 Best complexity: n Space complexity: 1 Method: Insertion Stable: Yes

fun <T : Comparable<T>> MutableList<T>.insertionSort(showPasses: Boolean = false)