Defining Pet Features and Essentials

[Geoff Canyon]

Sent from my iPhone

> On Feb 13, 2014, at 3:13 AM, Ender Nafi Elekcioglu <endernafi at keehuna.com> wrote:
> 
> I have used same algorithm both in C and Livecode
> and the results were ~29ms. vs ~8seconds.

As long as LC is dynamic (not compiled) it is unlikely to be as fast as C. 240x seems large, but I haven't compared to other languages to know what is reasonable. 

My point was more in comparison to other non-compiled languages, where tail recursion optimization is built in, so they are likely closer to C than LC for this. 

I've never heard of a language that memo-izes functions by default, but there are languages that make it trivial to do yourself, and that would be good. 

I just tested python on an ipad and it took about 30 seconds for fib(33).