mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-18 01:00:15 +00:00
Merge pull request #135 from KuLi/radix_sort-fix
#130 fixed radix sort for python 3
This commit is contained in:
commit
54eb79f53a
|
@ -2,19 +2,19 @@ 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
|
||||
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 ):
|
||||
|
@ -22,6 +22,6 @@ def radixsort(lst):
|
|||
for i in buck:
|
||||
lst[a] = i
|
||||
a += 1
|
||||
|
||||
|
||||
# move to next
|
||||
placement *= RADIX
|
||||
|
|
Loading…
Reference in New Issue
Block a user