FilesExpand file tree

Write-for-current-Python

/

bogo_sort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

49 lines (40 loc) · 1.34 KB

Write-for-current-Python

/

bogo_sort.py

Copy path

Top

File metadata and controls

• Code
• Blame

49 lines (40 loc) · 1.34 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

"""

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