Radix Sort. Θ(d(n+k)) => Θ(numOfDigits*(amount+scope))

from random import choices

def countingSort(source:[], digits:[], scope:int) -> []:
    counter = [0]*scope
    amount = len(source)

    for x in digits:
        counter[x] += 1

    for i in range(1, scope):
        counter[i] += counter[i-1]

    destination = [0]*amount

    for i in reversed(range(amount)):
        quantity = digits[i]
        # index = count-1
        destination[counter[quantity]-1] = source[i]
        counter[quantity] -= 1

    return destination

scope = 10
amount = 1000
numOfDigits = 3
source = choices(range(amount), k=amount)

for i in range(numOfDigits):
    digits = []
    for x in source:
        temp = x // (scope ** i)
        digit = temp % scope
        digits.append(digit)

    source = countingSort(source, digits, scope)
?著作權(quán)歸作者所有,轉(zhuǎn)載或內(nèi)容合作請(qǐng)聯(lián)系作者
平臺(tái)聲明：文章內(nèi)容（如有圖片或視頻亦包括在內(nèi)）由作者上傳并發(fā)布，文章內(nèi)容僅代表作者本人觀點(diǎn)，簡(jiǎn)書系信息發(fā)布平臺(tái)，僅提供信息存儲(chǔ)服務(wù)。

推薦閱讀更多精彩內(nèi)容