Improve fibonacci sequence using tail recursion

ligaroba / datastructures-and-algorithms

For beginners

1 stars 0 forks source link

Improve fibonacci sequence using tail recursion #1

Open jmnyarega opened 5 years ago

jmnyarega commented 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);  
}

tail-recursion resource
It is a technique that can improve performance when you have large inputs ✅

jmnyarega commented 5 years ago

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)