-
-
Notifications
You must be signed in to change notification settings - Fork 21
/
I_radixsort.py
40 lines (32 loc) · 959 Bytes
/
I_radixsort.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
38
39
40
def method1(ll: list) -> list:
def countingSort(arr, exp1):
n = len(arr)
output = [0] * (n)
count = [0] * (10)
for i in range(0, n):
index = arr[i] / exp1
count[int((index) % 10)] += 1
for i in range(1, 10):
count[i] += count[i - 1]
i = n - 1
while i >= 0:
index = arr[i] / exp1
output[count[int((index) % 10)] - 1] = arr[i]
count[int((index) % 10)] -= 1
i -= 1
i = 0
for i in range(0, len(arr)):
arr[i] = output[i]
def radixSort(arr):
max1 = max(arr)
exp = 1
while max1 / exp > 0:
countingSort(arr, exp)
exp *= 10
return radixSort(ll)
if __name__ == "__main__":
"""
l = ['1', '3', '4', '7', '5', '9']
from timeit import timeit
print(timeit(lambda: method1(l), number=10000)) # 0.002465166999172652
"""