Lua快速排序

-- region TestLua.lua

function Sort(list, leftIndex, rightIndex)
    if (leftIndex >= rightIndex) then
        return
    end

    local i = leftIndex
    local j = rightIndex
    local baseValue = list[leftIndex]
    -- if i is j, then break the loop.
    while i < j do
        -- find a number less than base value in the half right of the list
        while i < j and list[j] >= baseValue do
            j = j - 1
        end
        list[i] = list[j]

        -- find a number large than or equal to base value in the half left of the list
        while i < j and list[i] <= baseValue do
            i = i + 1
        end
        list[j] = list[i]
    end
    list[j] = baseValue
    Sort(list, leftIndex, i - 1)
    Sort(list, j + 1, rightIndex)
end

--- <summary>
--- main logic.
--- </summary>
m_List = { 0, 4, 3, 2, 1 }
Sort(m_List, 1, #m_List)

--- <summary>
--- output string.
--- </summary>
m_Output = ""
for i, v in pairs(m_List) do
    m_Output = m_Output .. tostring(v) .. ", "
end
print("m_Output=" .. m_Output)

os.execute("pause")

-- endregion

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值