Open jmnyarega opened 5 years ago
https://github.com/ligaroba/datastructures-and-algorithms/blob/7086cc6a286d80d9e7ffa5e1f56b75a6eb851f6b/algos/fibonacci.py#L9-L18
function tailCallRecursion(n, n1, n2) { if (n === 0) return n1; else if (n === 1) return n2; else return tailCallRecursion(n - 1, n2, n2 + n1); }
Python equivalent?
def fibonacci(n, n1, n2): if (n == 0) return n1 elif (n == 1) return n2 else return fibonacci(n- 1, n2, n2 + n1)
https://github.com/ligaroba/datastructures-and-algorithms/blob/7086cc6a286d80d9e7ffa5e1f56b75a6eb851f6b/algos/fibonacci.py#L9-L18