mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-06 21:59:30 +00:00
28 lines
580 B
Python
28 lines
580 B
Python
|
def radixsort(lst):
|
||
|
|
RADIX = 10
|
||
|
|
maxLength = False
|
||
|
|
tmp , placement = -1, 1
|
||
|
|
|
||
|
|
while not maxLength:
|
||
|
|
maxLength = True
|
||
|
|
# declare and initialize buckets
|
||
|
|
buckets = [list() for _ in range( RADIX )]
|
||
|
|
|
||
|
|
# split lst between lists
|
||
|
|
for i in lst:
|
||
|
|
tmp = i / placement
|
||
|
|
buckets[tmp % RADIX].append( i )
|
||
|
|
if maxLength and tmp > 0:
|
||
|
|
maxLength = False
|
||
|
|
|
||
|
|
# empty lists into lst array
|
||
|
|
a = 0
|
||
|
|
for b in range( RADIX ):
|
||
|
|
buck = buckets[b]
|
||
|
|
for i in buck:
|
||
|
|
lst[a] = i
|
||
|
|
a += 1
|
||
|
|
|
||
|
|
# move to next
|
||
|
|
placement *= RADIX
|