基数排序，进阶路上的全新法门！

2024-02-18 02:01:05

基数排序——非比较型排序新视野

在浩瀚的排序算法家族中，基数排序以其非比较型的独特理念脱颖而出。它不以元素间的直接比较为基础，而是将整数按位数切割成不同的数字，再按每个位数分别比较。这种创新的思路不仅适用于整数排序，更可用于字符串（如名字或日期）和特定格式的浮点数。

LSD基数排序——直观易懂的进阶之旅

众多基数排序算法中，LSD基数排序（Least Significant Digit）以其直观易懂的流程备受推崇。LSD基数排序从整数的最低有效位开始，逐步比较每个位数，将元素有序排列。其过程清晰明了，为初学者理解基数排序奠定了坚实基础。

算法之美——代码示例与深入解析

def radix_sort(nums):
    max_num = max(nums)
    exp = 1
    while max_num // exp > 0:
        counting_sort(nums, exp)
        exp *= 10  # Move to the next digit

def counting_sort(nums, exp):
    n = len(nums)
    output = [0] * n
    count = [0] * 10  # Count array to store the count of each digit

    # Store the count of occurrences in count[]
    for i in range(n):
        index = nums[i] // exp
        count[index % 10] += 1

    # Change count[i] so that count[i] contains the actual
    # position of this digit in the output[]
    for i in range(1, 10):
        count[i] += count[i - 1]

    # Build the output array
    i = n - 1
    while i >= 0:
        index = nums[i] // exp
        output[count[index % 10] - 1] = nums[i]
        count[index % 10] -= 1
        i -= 1

    # Copy the output array to nums[], so that nums[] contains sorted numbers
    for i in range(n):
        nums[i] = output[i]