PresleyGo的博客

最近回头看了下排序算法，用lua实现，随手记录一下a = {1,3,5,2,6,8,10,3,6,20}--冒泡排序（从头到尾排序，相邻两个互相对比）local function MaoPao(t, isIncrease) local count = #a for j = 1, count -1 do for i = 1, count - 1 do local pre ...

a = {1,3,5,2,6,8,10,3,6,20}--快速排序(以数组最左边的值为基准，比它小的放左边，比它大的放右边，然后再对左右两边的数组进行同样的操作，直到细分排列完成)local function KuaiSuPaiXu(arr, startIndex, endIndex) if startIndex >= endIndex then return end l...

a = {1,3,5,2,6,8,10,3,6,20,12}--插入排序：从前面往后增1截取数组进行排序，新增的值进行插入检测，从后遍历与上一位对比，小则调换位置local function ChaRuPaiXu(arr) local length = #arr local i = 1 local j = 1 for i = 2, length do for j = i, 2,...