Closed GPLeemrijse closed 2 years ago
A very heavy metal showcase of Rockstar's recursion capabilities.
The classic recursive fibonacci definition:
fib(n): if(n <= 1): return n; return fib(n-1) + fib(n-2);
The reason for including this as an example is because as far as I can tell no other examples make use of recursion.
A very heavy metal showcase of Rockstar's recursion capabilities.
The classic recursive fibonacci definition:
The reason for including this as an example is because as far as I can tell no other examples make use of recursion.