mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-01 00:41:09 +00:00
22 lines
426 B
Python
22 lines
426 B
Python
|
def insertionSort(arr):
|
||
|
|
"""
|
||
|
|
>>> a = arr[:]
|
||
|
|
>>> insertionSort(a)
|
||
|
|
>>> a == sorted(a)
|
||
|
|
True
|
||
|
|
"""
|
||
|
|
for i in range(1, len(arr)):
|
||
|
|
key = arr[i]
|
||
|
|
j = i - 1
|
||
|
|
while j >= 0 and key < arr[j]:
|
||
|
|
arr[j + 1] = arr[j]
|
||
|
|
j -= 1
|
||
|
|
arr[j + 1] = key
|
||
|
|
|
||
|
|
|
||
|
|
arr = [12, 11, 13, 5, 6]
|
||
|
|
insertionSort(arr)
|
||
|
|
print("Sorted array is:")
|
||
|
|
for i in range(len(arr)):
|
||
|
|
print("%d" % arr[i])
|