function randomSort(nums)
local n=#nums
for i=1,n do
local k=math.random(1,n)
nums[i],nums[k]=nums[k],nums[i]
end
end
选择排序
function selectSort(numbers)
local n=#numbers
for i=1,n do
local minIndex=i
for j=i+1,n do
if numbers[j]<numbers[minIndex] then
minIndex=j
end
end
numbers[i],numbers[minIndex]=numbers[minIndex],numbers[i]
end
end
冒泡排序
function bubbleSort(nums)
local n=#nums
for i=1,n,1 do
for j=n,i+1,-1 do
if nums[j]<nums[j-1] then
nums[j],nums[j-1]=nums[j-1],nums[j]
end
end
end
end
直接插入排序
function insertSort(nums)
local n=#nums
for i=2,n do
local j=i-1
local temp=nums[i]
while j>=1 and nums[j]>temp do
nums[j+1]=nums[j]
j=j-1
end
nums[
洗牌算法function randomSort(nums) local n=#nums for i=1,n do local k=math.random(1,n) nums[i],nums[k]=nums[k],nums[i] endend选择排序function selectSort(numbers) local n=#numbers for i=1,n d...