快速排序算法(table.sort 的默认算法)
时间开销:短
稳定性:
复杂度:
math.randomseed(os.time());
local real_print = print;
local nLine = 0;
function print(...)
real_print(nLine, ...)
nLine = nLine + 1;
end
local t = {}
local function dump()
-- print(table.concat(t, ","));
end;
for i = 1, 256 do
table.insert(t, math.random(i), i);
end
function