-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.py
55 lines (40 loc) · 934 Bytes
/
main.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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
import itertools
import random
import time
def timeit(func):
def wrapper(*args, **kwargs):
t = time.time()
res = func(*args, **kwargs)
print('Time for {}: {}'.format(func.__name__, time.time() - t))
return res
return wrapper
@timeit
def python_sort(a):
return sorted(a)
@timeit
def radix_sort(a):
m = 16
size = 1 << m
max_a = max(a)
decades = 0
while max_a:
decades += 1
max_a >>= m
shift = 0
while decades:
by_key = [
[]
for _ in range(size)
]
for t in a:
by_key[(t >> shift) & (size - 1)].append(t)
a = list(itertools.chain(*by_key))
shift += m
decades -= 1
return a
if __name__ == '__main__':
a = [
random.randint(0, 1000 * 1000 * 1000)
for _ in range(100 * 1000 * 1000)
]
assert python_sort(a) == radix_sort(a)