bogo_sort.py

"""
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
"""

importrandom


defbogo_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]
 """

defis_sorted(collection):
foriinrange(len(collection) -1):
ifcollection[i] >collection[i+1]:
returnFalse
returnTrue

whilenotis_sorted(collection):
random.shuffle(collection)
returncollection


if__name__=="__main__":
user_input=input("Enter numbers separated by a comma:\n").strip()
unsorted= [int(item) foriteminuser_input.split(",")]
print(bogo_sort(unsorted))