【入门夯实】冒泡排序的实现与优化：提前退出与边界收缩

local function badBubble(t)
    for i = 1, #t do
        for j = 1, #t - 1 do
            if t[j] < t[j + 1] then
                t[j], t[j + 1] = t[j + 1], t[j]
            end
        end
    end
end

local function bubbleDesc(t)
    local n = #t
    for i = 1, n - 1 do
        local swapped = false
        for j = 1, n - i do
            if t[j].score < t[j + 1].score 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

local board = {}
for i = 1, 20 do
    board[i] = { name = "成员" .. i, score = math.random(100, 9999) }
end
bubbleDesc(board)

table.sort(board, function(a, b)
    return a.score > b.score
end
)