blob: dfb79009e226e1f52d8a1bbe77fd2610dba6f6b3 (
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
28
29
30
31
32
33
34
35
36
37
38
39
40
|
#!/bin/python3
# --------- Insertion sort
# --------- Imported modules
import inputoutput as io
import csv
import sys
# ingressing
target = sys.argv[1]
numdata = io.ingressCSV(target)
# 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)
# sorting call
insertionSort(numdata)
# wrapping up
print("Sorting done! Writing to file.")
io.egressCSV(numdata,target)
|
