# LUA 排序算法和性能分析[4]:快速排序算法

```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 table_sort()
table.sort(t);
dump()
end

-- table_sort() -- 0.3

-- 冒泡排序
function bubble_sort()
print("冒泡排序")
local n = #t;
for j = 1, n - 1 do

for i = 1, n - j do

if t[i] > t[i+1] then
t[i], t[i+1] = t[i+1], t[i];
dump()
end;
end;
end;
dump()
end;

-- bubble_sort(); -- 5.7

-- 选择排序
function select_sort()
print("选择排序")
local n = #t;
for i = 0, n - 2 do

local min = i;
for j = i + 1, n - 1 do

if t[min+1] > t[j+1] then
min = j;
end;
end;

if (min ~= i) then
t[min+1], t[i+1] = t[i+1], t[min+1];
dump()
end;
end;
dump()
end;

-- select_sort() -- 3.4

-- 快速排序
function quick_sort()
print("快速排序")
local function sort(left, right)

if left >= right then
return ;
end;

local i     = left;
local j     = right;
local key   = t[left];

while (i < j) do

while i < j and key <= t[j] do

j = j - 1;
end;

t[i] =  t[j];
dump()

while i < j and key >= t[i] do

i = i + 1;
end;
t[j] = t[i];
dump()
end;
t[i] = key;
dump()
sort(left, i - 1);
sort(i + 1, right);

end;
sort(1, #t)
end;

-- quick_sort() -- 0.4
```