Fibonnaci

Fibonacci.txt

// Fibonacci Function ( Recursion Case) (Very bad time complexity , very slow , the browser crash if you inter index of 50)

function fibonacci(position) {
    if (position < 3) {
        return 1;
    } else {
        return fibonacci(position - 1) + fibonacci(position - 2);
    }
}
fibonacci(6);
-------------------------------------------------------------------------------------------------------------------------------
    //Memoized Fibonnaci (Linear O(n) Time Complexity ) More effecient and fast
    function fibMemo(index, cache) {
        cache = cache || [];
        //baseCase
        if (cache[index]) {
            return cache[index];
        } else {
            if (index < 3) {
                return 1;
            } else {
                cache[index] = fibMemo(index - 1, cache) + fibMemo(index - 2, cache);
            }
        }
        return cache[index];
    }
fibMemo(1000);