-
Notifications
You must be signed in to change notification settings - Fork 0
/
vectorSort.py
37 lines (29 loc) · 840 Bytes
/
vectorSort.py
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
def makeVector(array): #get max
largest = array[0]
for i in range(1, len(array)):
if (array[i] > largest):
largest = array[i]
vector = [0]*(largest+1)
for j in range(len(array)):
vector[array[j]] += 1
belowEqual = 0
for k in range(len(vector)):
belowEqual += vector[k]
vector[k] = belowEqual
# now sort (part b)----------------------------
c = 0
finalArray = [0]*len(array)
last = 0
for a in range(len(vector)):
if(vector[a] > last):
amountToAppend = vector[a] - last
for add in range(amountToAppend):
finalArray[c] = a
c += 1
last = vector[a]
for el in finalArray:
print(el)
def main():
array = [3, 5, 2, 5, 4, 10, 3, 4, 5, 6, 1, 0]
makeVector(array);
main()