recursive function for fibonacci series in java javascript
// Recursion way to return Fibonacci numbers
function recursiveFibonacci(n){
// base case
if(n === 0) return 0
if(n === 1) return 1
// recursioin base
return recursiveFibonacci(n - 2) + recursiveFibonacci(n - 1);
}
recursiveFibonacci(6) // should return 8
//////// and ////////
// Iteration way to return Fibonacci numbers
function iterativeFibonacci(n) {
if (n === 0) return 0;
if (n === 1) return 1;
let previous = 0;
let current = 1;
for (let i = n; i > 1; i--) {
let next = previous + current;
previous = current;
current = next;
}
return current;
}
iterativeFibonacci(6) // should return 8
3.67
9
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));
Thank you!
9
0
4
5
Enter the number of terms: 12
0
1
1
2
3
Thank you!
5
0
4.33
6
function fibonacci(n) {
if (n < 2){
return 1;
}else{
return fibonacci(n-2) + fibonacci(n-1);
}
}
console.log(fibonacci(7));
//Returns 21
Thank you!
6
0
4.33
6
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(2));
Thank you!
6
0
Are there any code examples left?
New code examples in category Javascript