使用Python实现基数排序算法原理的实例

def countingSort(array, place):    size = len(array)    output = [0] * size    count = [0] * 10    for i in range(0, size):        index = array[i] // place        count[index % 10] += 1     for i in range(1, 10):        count[i] += count[i - 1]    i = size - 1    while i >= 0:        index = array[i] // place        output[count[index % 10] - 1] = array[i]        count[index % 10] -= 1        i -= 1    for i in range(0, size):        array[i] = output[i]def radixSort(array):    # Get maximum element    max_element = max(array)    place = 1    while max_element // place > 0:        countingSort(array, place)        place *= 10data = [121, 432, 564, 23, 1, 45, 788]radixSort(data)print(data)