bogo sort Algorithm
The bogo sort algorithm, also known as stupid sort, random sort, or monkey sort, is a highly ineffective and inefficient sorting algorithm based on the principle of pure randomness. It is primarily used for educational purposes or as a joke due to its lack of practicality in real-world situations. The algorithm works by randomly shuffling or permuting the elements of a list until the list is sorted.
The bogo sort algorithm has a worst-case time complexity of O(n!) or O((n+1)!) depending on the implementation, which makes it highly impractical for use in any realistic scenario. In the best case, the algorithm may sort the list in just one iteration, but the probability of that happening is extremely low, especially as the size of the list grows. Due to its overall inefficiency and lack of any redeeming qualities, the bogo sort algorithm serves as a reminder of what not to do when designing a sorting algorithm for practical applications.
"""
This is a pure Python implementation of the bogosort algorithm,
also known as permutation sort, stupid sort, slowsort, shotgun sort, or monkey sort.
Bogosort generates random permutations until it guesses the correct one.
More info on: https://en.wikipedia.org/wiki/Bogosort
For doctests run following command:
python -m doctest -v bogo_sort.py
or
python3 -m doctest -v bogo_sort.py
For manual testing run:
python bogo_sort.py
"""
import random
def bogo_sort(collection):
"""Pure implementation of the bogosort algorithm in Python
:param collection: some mutable ordered collection with heterogeneous
comparable items inside
:return: the same collection ordered by ascending
Examples:
>>> bogo_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
>>> bogo_sort([])
[]
>>> bogo_sort([-2, -5, -45])
[-45, -5, -2]
"""
def is_sorted(collection):
if len(collection) < 2:
return True
for i in range(len(collection) - 1):
if collection[i] > collection[i + 1]:
return False
return True
while not is_sorted(collection):
random.shuffle(collection)
return collection
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(bogo_sort(unsorted))
