Fibonacci

function findFibonacciRecursive(n) {
    if( n <= 0) {
        return 0;
    }
    if(n === 1) {
        return n;
    }
    return findFibonacciRecursive(n-1) + findFibonacciRecursive(n-2);
}

function findFibonacciIterative(n) {
    let sum1= 0;
    let sum2= 1
    for(let i = 0; i < n-1; i++) {
        answer = sum1 + sum2;
        sum1 = sum2;
        sum2 = answer;
    }
    return answer;
}

console.log(findFibonacciRecursive(3));
console.log(findFibonacciIterative(3));