Lua冒泡排序：相邻交换的逐轮沉底

local function sort(t)
    for i = 1, #t do
        for j = 1, #t do
            if t[j] > t[j + 1] then   -- j+1越界，末位比nil报错
                t[j], t[j + 1] = t[j + 1], t[j]
            end
        end
    end
end

local function bubble(t)
    local n = #t
    for i = 1, n - 1 do
        local swapped = false
        for j = 1, n - i do         -- 边界随轮次收缩
            if t[j] > t[j + 1] then
                t[j], t[j + 1] = t[j + 1], t[j]
                swapped = true
            end
        end
        if not swapped then break end   -- 无交换提前收工
    end
    return t
end
sendmsg(actor, 1, "最小伤害 " .. bubble({320, 150, 480, 90})[1])