iframe-proxy | Sunbelt Computer Software

History

49 lines (40 loc) · 1.34 KB

Raw

"""

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

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

Sunbelt Computer Software

PL/B Language Development and Support

Navigation Menu

Sunbelt Computer Software

PL/B Language Development and Support

FilesExpand file tree

bogo_sort.py

Latest commit

History

bogo_sort.py

File metadata and controls