[REBOL] Re: The Great Computer Language Shootout
From: pwoodward:cncdsl at: 3-Jan-2002 16:42
Petr - on a quick run-thru of the Ackermann function - w/o optimization: ackermann: function [x y] [] [ if x = 0 [ return y + 1 ] if y = 0 [ return ackermann x - 1 1 ] return ackermann x - 1 ackermann x y - 1 ] started: now/time for i 1 8 1 [ print ackermann 3 i ] print ["elapsed time" now/time - started] I get a stack overflow if I allow y to grow to 8, but it takes 11 seconds to get to 7.... - Porter