Answers for "fibonacci series using recursion javasc"

recursive function for fibonacci series in java javascript

var fib = function(n) {
  if (n === 1) {
    return [0, 1];
  } else {
    var arr = fib(n - 1);
    arr.push(arr[arr.length - 1] + arr[arr.length - 2]);
    return arr;
  }
};

console.log(fib(8));

Posted by: Guest on May-08-2020

Source

Code answers related to "fibonacci series using recursion javasc"

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

Answers for "fibonacci series using recursion javasc"

Code answers related to "fibonacci series using recursion javasc"

Code answers related to "Javascript"

Javascript Answers by Framework

Browse Popular Code Answers by Language

Answers for "fibonacci series using recursion javasc"

Code answers related to "fibonacci series using recursion javasc"

Code answers related to "Javascript"

Javascript Answers by Framework

Browse Popular Code Answers by Language

Popular Programming Languages

Advertisements

Company

Compilers

Help

Connect with us