mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-01-18 16:27:02 +00:00
976e81f88d
Bogosort randomly sorts a list until it is sorted. Its computational complexity has a best case of O(n) and a worst case of O(n!). |
||
---|---|---|
.. | ||
bogosort.py | ||
bubble_sort.py | ||
insertion_sort.py | ||
merge_sort.py | ||
quick_sort.py | ||
selection_sort.py |