aboutsummaryrefslogtreecommitdiff
path: root/t.lua
blob: 2e906dbadda9bd289e8babebf915e644e4694a75 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
require "llib"
local a = llib.array

local tab = {}
math.randomseed(os.time())
for i=1,9999 do
  table.insert(tab,math.random(1,999));-- + math.random(1,999));
end

print("length of 99999 :\n")
time = os.clock()
local l1 = a.quicksort(tab)
print("quick sort took "..os.clock()-time.."s")
time = os.clock()
local l2 = a.mergesort(tab)
print("merge sort took "..os.clock()-time.."s")
time = os.clock()
local l3 = a.shellsort(tab)
print("shell sort took "..os.clock()-time.."s")
time = os.clock()
local l4 = a.bubblesort(tab)
print("bubble sort took "..os.clock()-time.."s")
time = os.clock()
local l5 = a.heapsort(tab)
print("heap sort took "..os.clock()-time.."s")
time = os.clock()
local l6 = a.countingsort(tab)
print("counting sort took "..os.clock()-time.."s")

for l,i in pairs(llib.array.reverse(l1)) do
  --print(l1[l].." "..l2[l].." "..l3[l].." "..l4[l].." "..l5[l])
end
--print(llib.array.greatest(l1))
--local l2 = llib.array.reverse(llib.array.bubblesort(tab))
--[[ aa 
for l,i in pairs(l1) do
  print(l1[l].." "..l2[l])
end

print(table.concat(l1) == table.concat(l2)) ]]--