blob: 350c88b692de15457098644ea39577fca8ac9c4f (
plain)
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
|
#!/bin/python3
import inputoutput as io
import csv
import sys
# insertion sort algorithm, as function
def insertionSort(data):
for i in range(1, len(data)):
key = data[i]
j = i - 1
# left comparison
while j >= 0 and key < data[j]:
data[j + 1] = data[j]
j = j - 1
# move key after element smaller than it
data[j + 1] = key
testarr = [99,77,44,22,11,33]
print(testarr)
insertionSort(testarr)
#FIXME: no return argument needed!
print(testarr)
|
