FilesExpand file tree

 Write-for-current-Python

/

gnome_sort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

56 lines (41 loc) · 1.36 KB

 Write-for-current-Python

/

gnome_sort.py

Copy path

Top

File metadata and controls

• Code
• Blame

56 lines (41 loc) · 1.36 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

50

51

52

53

54

55

56

"""

Gnome Sort Algorithm (A.K.A. Stupid Sort)

This algorithm iterates over a list comparing an element with the previous one.

If order is not respected, it swaps element backward until order is respected with

previous element. It resumes the initial iteration from element new position.

For doctests run following command:

python3 -m doctest -v gnome_sort.py

For manual testing run:

python3 gnome_sort.py

"""

def gnome_sort(lst: list) -> list:

"""

Pure implementation of the gnome sort algorithm in Python

Take some mutable ordered collection with heterogeneous comparable items inside as

arguments, return the same collection ordered by ascending.

Examples:

>>> gnome_sort([0, 5, 3, 2, 2])

[0, 2, 2, 3, 5]

>>> gnome_sort([])

[]

>>> gnome_sort([-2, -5, -45])

[-45, -5, -2]

>>> "".join(gnome_sort(list(set("Gnomes are stupid!"))))

' !Gadeimnoprstu'

"""

if len(lst) <= 1:

return lst

i = 1

while i < len(lst):

if lst[i - 1] <= lst[i]:

i += 1

else:

lst[i - 1], lst[i] = lst[i], lst[i - 1]

i -= 1

if i == 0:

i = 1

return lst

if __name__ == "__main__":

user_input = input("Enter numbers separated by a comma:\n").strip()

unsorted = [int(item) for item in user_input.split(",")]

print(gnome_sort(unsorted))