【高级技巧】桶排序：分数段的分布统计排序封装

local function bucketSort(records, bucketSize)
    local max = 0
    for _, r in ipairs(records) do
        if r.score > max then
            max = r.score
        end
    end
    local bucketCount = math.ceil(max / bucketSize)
    local buckets = {}
    for i = 1, bucketCount do
        buckets[i] = {}
    end
    for _, r in ipairs(records) do
        local idx = math.ceil(r.score / bucketSize)
        table.insert(buckets[idx], r)
    end
    local out = {}
    for i = 1, bucketCount do
        table.sort(buckets[i], function(a, b)
            return a.score < b.score
        end
        )
        for _, r in ipairs(buckets[i]) do
            out[#out + 1] = r
        end
    end
    return out
end

local sorted = bucketSort(records, 100)
for _, r in ipairs(sorted) do
    print(r.name .. " " .. r.score)
end