mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-01-18 16:27:02 +00:00
Fix sorts/radix_sort (#338)
This commit is contained in:
parent
faf16d7ced
commit
17a6d1c1a7
|
@ -1,28 +1,26 @@
|
|||
def radixsort(lst):
|
||||
RADIX = 10
|
||||
maxLength = False
|
||||
tmp , placement = -1, 1
|
||||
RADIX = 10
|
||||
placement = 1
|
||||
|
||||
while not maxLength:
|
||||
maxLength = True
|
||||
# declare and initialize buckets
|
||||
buckets = [list() for _ in range( RADIX )]
|
||||
# get the maximum number
|
||||
max_digit = max(lst)
|
||||
|
||||
# split lst between lists
|
||||
for i in lst:
|
||||
tmp = int((i / placement) % RADIX)
|
||||
buckets[tmp].append(i)
|
||||
while placement < max_digit:
|
||||
# declare and initialize buckets
|
||||
buckets = [list() for _ in range( RADIX )]
|
||||
|
||||
if maxLength and tmp > 0:
|
||||
maxLength = False
|
||||
# split lst between lists
|
||||
for i in lst:
|
||||
tmp = int((i / placement) % RADIX)
|
||||
buckets[tmp].append(i)
|
||||
|
||||
# empty lists into lst array
|
||||
a = 0
|
||||
for b in range( RADIX ):
|
||||
buck = buckets[b]
|
||||
for i in buck:
|
||||
lst[a] = i
|
||||
a += 1
|
||||
# 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
|
||||
# move to next
|
||||
placement *= RADIX
|
||||
|
|
Loading…
Reference in New Issue
Block a user