mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-28 07:21:07 +00:00
47a9ea2b0b
* Simplify code by dropping support for legacy Python * sort() --> sorted()
26 lines
638 B
Python
26 lines
638 B
Python
"""Gnome Sort Algorithm."""
|
|
|
|
|
|
def gnome_sort(unsorted):
|
|
"""Pure implementation of the gnome sort algorithm in Python."""
|
|
if len(unsorted) <= 1:
|
|
return unsorted
|
|
|
|
i = 1
|
|
|
|
while i < len(unsorted):
|
|
if unsorted[i - 1] <= unsorted[i]:
|
|
i += 1
|
|
else:
|
|
unsorted[i - 1], unsorted[i] = unsorted[i], unsorted[i - 1]
|
|
i -= 1
|
|
if (i == 0):
|
|
i = 1
|
|
|
|
|
|
if __name__ == '__main__':
|
|
user_input = input('Enter numbers separated by a comma:\n').strip()
|
|
unsorted = [int(item) for item in user_input.split(',')]
|
|
gnome_sort(unsorted)
|
|
print(unsorted)
|