mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-24 05:21:09 +00:00
67b33a295b
* optimization
* updating DIRECTORY.md
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
41 lines
1.1 KiB
Python
41 lines
1.1 KiB
Python
"""
|
|
https://en.wikipedia.org/wiki/Shellsort#Pseudocode
|
|
"""
|
|
|
|
|
|
def shell_sort(collection):
|
|
"""Pure implementation of shell sort algorithm in Python
|
|
:param collection: Some mutable ordered collection with heterogeneous
|
|
comparable items inside
|
|
:return: the same collection ordered by ascending
|
|
|
|
>>> shell_sort([0, 5, 3, 2, 2])
|
|
[0, 2, 2, 3, 5]
|
|
>>> shell_sort([])
|
|
[]
|
|
>>> shell_sort([-2, -5, -45])
|
|
[-45, -5, -2]
|
|
"""
|
|
# Marcin Ciura's gap sequence
|
|
|
|
gaps = [701, 301, 132, 57, 23, 10, 4, 1]
|
|
for gap in gaps:
|
|
for i in range(gap, len(collection)):
|
|
insert_value = collection[i]
|
|
j = i
|
|
while j >= gap and collection[j - gap] > insert_value:
|
|
collection[j] = collection[j - gap]
|
|
j -= gap
|
|
if j != i:
|
|
collection[j] = insert_value
|
|
return collection
|
|
|
|
|
|
if __name__ == "__main__":
|
|
from doctest import testmod
|
|
|
|
testmod()
|
|
user_input = input("Enter numbers separated by a comma:\n").strip()
|
|
unsorted = [int(item) for item in user_input.split(",")]
|
|
print(shell_sort(unsorted))
|