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));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));
Also in Java:
- java string length validation regex
- java doreturn void
- java script to detect and launch all browsers
- floor in java
- how to take binary input in java
- how to get individual words from a string in java
- armstrong number in java
- java divisible by operator
- java remove double spaces
- java program to display characters from a to z using loop
- gson parse json
- change brightness of image in java
- bracket balancing program in java
- android studio clear views of layout
- java exit
- how to compare two maps in java
- java math.random
- java question mark operator
- determine if a given binary tree is a valid bst
- set java
- how make a final variable in java
- java convert string with commas to long
- check last character of string java
- java get current date without time