Skip to content

Embed URL

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
Calculates arbitrary points in the fibonacci sequence using recursion. This is actually salesforce Apex code, not java.
# this is, obviously, just an apex exploration
# i.e. horribly inefficient
Integer fib(Integer n) {
if (n <= 1) return 1; else return fib(n-1) + fib(n-2);
}
for (Integer i=0; i<=12; i++) {
System.debug(fib(i));
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Something went wrong with that request. Please try again.