dataStructuresAndAlgorithms/dev.funkymuse.datastructuresandalgorithms.sort/bogoSort

bogoSort

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

Bogo sort is a very inefficient sorting algorithm. Principle: Shuffle the list until it is sorted.

Worst complexity: Infinite Average complexity: n*n! Best complexity: n Space complexity: 1 Stable: No