forked from Mirror/wren
edb9032052
Wren is actually doing well in it: wren mean: 1.9441 median: 1.9428 std_dev: 0.0260 lua mean: 3.5992 median: 3.6033 std_dev: 0.0156 python mean: 3.6667 median: 3.7097 std_dev: 0.1340 ruby mean: 1.3941 median: 1.3914 std_dev: 0.0091
55 lines
1.4 KiB
Lua
55 lines
1.4 KiB
Lua
-- The Computer Language Benchmarks Game
|
|
-- http://shootout.alioth.debian.org/
|
|
-- contributed by Mike Pall
|
|
|
|
local function BottomUpTree(item, depth)
|
|
if depth > 0 then
|
|
local i = item + item
|
|
depth = depth - 1
|
|
local left, right = BottomUpTree(i-1, depth), BottomUpTree(i, depth)
|
|
return { item, left, right }
|
|
else
|
|
return { item }
|
|
end
|
|
end
|
|
|
|
local function ItemCheck(tree)
|
|
if tree[2] then
|
|
return tree[1] + ItemCheck(tree[2]) - ItemCheck(tree[3])
|
|
else
|
|
return tree[1]
|
|
end
|
|
end
|
|
|
|
local N = 14
|
|
local mindepth = 4
|
|
local maxdepth = mindepth + 2
|
|
if maxdepth < N then maxdepth = N end
|
|
|
|
local start = os.clock()
|
|
|
|
do
|
|
local stretchdepth = maxdepth + 1
|
|
local stretchtree = BottomUpTree(0, stretchdepth)
|
|
io.write(string.format("stretch tree of depth %d\t check: %d\n",
|
|
stretchdepth, ItemCheck(stretchtree)))
|
|
end
|
|
|
|
local longlivedtree = BottomUpTree(0, maxdepth)
|
|
|
|
for depth=mindepth,maxdepth,2 do
|
|
local iterations = 2 ^ (maxdepth - depth + mindepth)
|
|
local check = 0
|
|
for i=1,iterations do
|
|
check = check + ItemCheck(BottomUpTree(1, depth)) +
|
|
ItemCheck(BottomUpTree(-1, depth))
|
|
end
|
|
io.write(string.format("%d\t trees of depth %d\t check: %d\n",
|
|
iterations*2, depth, check))
|
|
end
|
|
|
|
io.write(string.format("long lived tree of depth %d\t check: %d\n",
|
|
maxdepth, ItemCheck(longlivedtree)))
|
|
|
|
io.write(string.format("elapsed: %.8f\n", os.clock() - start))
|