10 examples of 'fibonacci series in javascript using array' in JavaScript

Every line of 'fibonacci series in javascript using array' code snippets is scanned for vulnerabilities by our powerful machine learning engine that combs millions of open source libraries, ensuring your JavaScript code is secure.

All examples are scanned by Snyk Code

By copying the Snyk Code Snippets you agree to
this disclaimer
4export default function* fibonacci() {
5 let f = (a, b) => a + b;
6 let s = series(f, 1, 1);
7 let predicate = n => n < Number.MAX_SAFE_INTEGER;
8 yield* takeWhile(s, predicate);
9}
Important

Use secure code every time

Secure your code as it's written. Use Snyk Code to scan source code in minutes – no build needed – and fix issues immediately. Enable Snyk Code

62function getFibonacci(n) {
63 var fibarr = [];
64 var i = 0;
65 while(i<n) {
66 if(i<=1) {
67 fibarr.push(i);
68 }else{
69 fibarr.push(fibarr[i-1] + fibarr[i-2])
70 }
71 i++;
72 }
73
74 return fibarr;
75}
2function fibonacci(n) {
3 return fibonacciRecursion(n, [1,1]);
4}
1function fibonacci(n, a = 0, b = 1) {
2 return n < 1 ? a : fibonacci(n - 1, a + b, a);
3}
1function fibonacci(num) {
2 var n = Number(num);
3 var first = 0;
4 var second = 1;
5 var result = 0;
6 for (var i = 1; i <= n; i++) {
7 result = first + second;
8 first = second;
9 second = result;
10 console.log(i + ": " + first + "\n");
11 }
12}
115function fibonacci( n ) {
116 if ( n < 2 ) {
117 return n;
118 }
119 return fibonacci( n-1 ) + fibonacci( n-2 );
120}
1function fibonacci(n) {
2 const sequence = [0, 1];
3
4 for (let i = 2; i <= n; i++) {
5 sequence[i] = sequence[i - 1] + sequence[i - 2];
6 }
7
8 return sequence[n];
9}
5function fibonacci(x) {
6 return x <= 1 ? x : fibonacci(x - 1) + fibonacci(x - 2);
7}
1function fibonacci(n) {
2 let a = 1
3 let b = 0
4
5 while (n > 0) {
6 let temp = a
7 a = a + b
8 b = temp
9 n--
10 }
11
12 return b
13}
14function fibonacci(n) {
15 var res;
16 if (fibonacci.stack[n]) return fibonacci.stack[n];
17 if (n < 2)
18 res = 1;
19 else
20 res = fibonacci(n - 2) + fibonacci(n - 1);
21
22 return (fibonacci.stack[n] = res);
23}

Related snippets