Answers for "fibbonacci using recursion in js"

Javascript

0

fibonacci sums javascript

// Implement a method that finds the sum of the first n
// fibonacci numbers recursively. Assume n > 0

function fibsSum(n) {
    if ( n === 1 ) {
        return 1;
    }
    if (n === 2 ) {
        return 2;
    }
    let sum = fibsSum(n-1) + n;
    return sum;
}

Posted by: Guest on October-24-2020

Code answers related to "fibbonacci using recursion in js"

Code answers related to "Javascript"

Javascript Answers by Framework

Browse Popular Code Answers by Language

Python

Javascript

Whatever

Shell/Bash

CSS

Html

PHP

SQL

Java

C#