mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-07-06 18:49:26 +08:00
PEP style and tree traversals
This commit is contained in:
@ -17,31 +17,30 @@ def shell_sort(collection):
|
||||
: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])
|
||||
|
||||
>>> 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:
|
||||
i = gap
|
||||
while i < len(collection):
|
||||
temp = collection[i]
|
||||
j = i
|
||||
while j >= gap and collection[j-gap] > temp:
|
||||
while j >= gap and collection[j - gap] > temp:
|
||||
collection[j] = collection[j - gap]
|
||||
j -= gap
|
||||
collection[j] = temp
|
||||
i += 1
|
||||
|
||||
|
||||
|
||||
return collection
|
||||
|
||||
if __name__ == '__main__':
|
||||
|
Reference in New Issue
Block a user