root/trunk/benchmark/recursive.md

Revision 362, 1.0 kB (checked in by JarrettBillingsley, 3 months ago)

Fixed a bug where array data was being allocated but not initialized, causing some GC cycles to try to scan garbage data (and crash). Updated the benchmarks and all that I've tested have worked fine, not to mention being at least 15% faster in most cases :)

Line 
1 module benchmark.recursive
2
3 // n = 11, 345.122 sec
4 // On laptop, 284.581 sec
5
6 function ack(m, n)
7 {
8     if(m == 0)
9         return n + 1
10
11     if(n == 0)
12         return ack(m - 1, 1)
13
14     return ack(m - 1, (ack(m, n - 1)))
15 }
16
17 function fib(n)
18 {
19     if(n < 2)
20         return 1
21
22     return fib(n - 2) + fib(n - 1)
23 }
24
25 function tak(x, y, z)
26 {
27     if(y >= x)
28         return z
29
30     return tak(tak(x - 1, y, z), tak(y - 1, z, x), (tak(z - 1, x, y)))
31 }
32
33 function main(N)
34 {
35     local n = 11
36    
37     if(isString(N))
38     {
39         writeln("F")
40         n = toInt(N) //try n = toInt(N); catch(e){}
41     }
42     else
43         writeln("G")
44
45     local timer = time.Timer.clone()
46     timer.start()
47
48         writefln("Ack(3, {}): {}", n, ack(3, n))
49         writefln("Fib({:1}): {:1}", n + 27.0, fib(n + 27.0))
50
51         n--
52         writefln("Tak({}, {}, {}): {}", 3 * n, 2 * n, n, tak(3 * n, 2 * n, n))
53         writefln("Fib(3): {}", fib(3))
54         writefln("Tak(3.0, 2.0, 1.0): {:1}", tak(3.0, 2.0, 1.0))
55
56     timer.stop()
57     writefln("Took {} sec", timer.seconds())
58 }
Note: See TracBrowser for help on using the browser.