gulan0的博客

--快排算法local arr = {3,11,5,2,6,1,7,4,6,9,3}local function quickSort(tab,left,right) local i = left local j = right local x = tab[i] --每次执行快排的基准数字 if i < j then while(i < j) do for m = j,i,-1 do j = m if tab[m] < x then .