pmalek
7/15/2016 - 7:34 PM

fibonacci tail recursion

fibonacci tail recursion

int fib(int term, int val = 1, int prev = 0)
{
 if(term == 0) return prev;
 if(term == 1) return val;
 return fib(term - 1, val+prev, val);
}