Lua希尔排序

最新推荐文章于 2022-11-03 10:06:38 发布

徐皊

最新推荐文章于 2022-11-03 10:06:38 发布

阅读量312

点赞数 1

本文链接：https://blog.youkuaiyun.com/qq_37273889/article/details/85710909

版权

这篇博客详细介绍了如何在Lua中实现希尔排序，包括交换法和移动法两种策略，以提高数组排序效率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

交换法：

-- region TestLua.lua

function Sort(list)
    local gap = math.floor(#list / 2)
    while gap > 0 do
        for i = gap + 1, #list do
            local j = i
            while j > gap and list[j] < list[j - gap] do
                Swap(list, j, j - gap)
                j = j - gap
            end
        end
        gap = math.floor(gap / 2)
    end
end

function Swap(list, index0, index1)
    local temp = list[index0]
    list[index0] = list[index1]
    list[index1] = temp
end

--- <summary>
--- main logic.
--- </summary>
m_List = { 0, 4, 3, 2, 1 }
Sort(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

移动法：

-- region TestLua.lua

function Sort(list)
    local gap = math.floor(#list / 2)
    while gap > 0 do
        for i = gap + 1, #list do
            local j = i

            local temp = list[j];
            
            -- 前面已经是排好序的，所以前一个元素不大于这个元素的话，就证明这个元素已经是最大的元素了
            while (j - gap >= 1 and temp < list[j - gap]) do
                -- 移动法，每次list[j]都是覆盖
                list[j] = list[j - gap];
                j = j - gap;
            end
            list[j] = temp;
        end
        gap = math.floor(gap / 2)
    end
end

function Swap(list, index0, index1)
    local temp = list[index0]
    list[index0] = list[index1]
    list[index1] = temp
end

--- <summary>
--- main logic.
--- </summary>
m_List = { 0, 4, 3, 2, 1 }
Sort(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