Created
March 1, 2023 11:11
-
-
Save ATMI/a90e02f710808fb3117fadd87504dfa7 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from typing import List | |
def get_digit(i: int, d: int, b: int) -> (int, bool): | |
di = i // (b ** d) | |
return int(di % b), di // b == 0 | |
def counting_sort(a: List[int], k: int, d: int, s: int) -> (List[int], int): | |
b = [0] * len(a) | |
c = [0] * (k * 2) | |
for j in range(0, len(a)): | |
digit, is_last = get_digit(a[j], d, k) | |
c[k * (not is_last) + digit] += 1 | |
for i in range(1, k * 2): | |
c[i] += c[i - 1] | |
for j in range(len(a) - 1, -1, -1): | |
digit, is_last = get_digit(a[j], d, k) | |
if is_last: | |
s += 1 | |
c[k * (not is_last) + digit] -= 1 | |
b[c[k * (not is_last) + digit]] = a[j] | |
return b, s | |
def radix_sort(a: List[int], k: int) -> List[int]: | |
result = a[0:len(a)] | |
done = 0 | |
digit = 0 | |
while done != len(a): | |
result[done:len(a)], done = counting_sort(result[done:len(a)], k, digit, done) | |
digit += 1 | |
return result | |
r = radix_sort([10000, 44, 9, 99, 55, 131, 39, 2, 0], 10) | |
print(r) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Modified Radix-sort written in Python, that takes into account only significant part of positive numbers and ignores leading zeros