======== ApuC source =========== def fib(n){ if(fib < 2){ return 1; } return fib(n-1) + fib(n-2); } askAndWait("Enter a number n, and the nth fibonacci number will be displayed:"); say(fib(answer()));
Most likely the first project entirely generated by ApuC! http://scratch.mit.edu/discuss/topic/50212/ This was used as a recursion test to make sure the return stack works. It's actually surprising how much a complex language like ApuC simplifies Scratch operations like this. Compare the ApuC source above to the code inside the editor.
