lua实现快排,选择排序--与c++一样

function sortTable(table_array,lift_id,right_id)--lua实现快速排序


if(lift_id < right_id) then
local int_X    = table_array[lift_id]--标记中间点
local   length = right_id--记录长度
local start_id = lift_id
while lift_id < right_id do
while lift_id < right_id and table_array[right_id] >= int_X do
right_id = right_id - 1
end
if lift_id < right_id then
table_array[lift_id] = table_array[right_id]
lift_id = lift_id + 1 
end--右边--

while lift_id < right_id and table_array[lift_id] < int_X do
lift_id = lift_id + 1
end
if lift_id < right_id then
table_array[right_id] = table_array[lift_id]
right_id = right_id - 1
end



end
table_array[lift_id] = int_X
--[[for i,v in ipairs(table_array) do
print(i,v)
end--]]


print("my sortTable First",start_id,lift_id-1)
sortTable(table_array,start_id,lift_id-1)
print("my sortTable Second",right_id+1,length)
sortTable(table_array,right_id+1,length)
end
end


function sortTable1(table_array)--选择排序
for i=1,#table_array-1,1 do
for j=i+1,#table_array,1 do
if table_array[i] > table_array[j] then
table_array[i],table_array[j] = table_array[j],table_array[i]
end
end
end
end


local array = {31,345,22,15454,12,5452,11,23,1254,234,12,11,65,78,22,31,44,23,41,545,31,45,234}
sortTable(array,1,23)--快速排序
--sortTable1(array)
for i,v in ipairs(array) do
print(i,v)
end