Use function recursion for cleaner code.
This commit is contained in:
parent
3b51e5dbef
commit
467c5f7a1d
|
@ -1,14 +1,13 @@
|
||||||
const fibonacci = function(count) {
|
const fibonacci = function(index) {
|
||||||
if (count < 0) return "OOPS";
|
const n = Number(index);
|
||||||
if (count == 0) return 0;
|
|
||||||
let a = 0;
|
if (n === 1 || n === 2) {
|
||||||
let b = 1;
|
return 1;
|
||||||
for (let i = 1; i < count; i++) {
|
} else if (n > 2) {
|
||||||
const temp = b;
|
return fibonacci(n - 1) + fibonacci(n - 2);
|
||||||
b = a + b;
|
} else if (n <= 0) {
|
||||||
a = temp;
|
return "OOPS";
|
||||||
}
|
}
|
||||||
return b;
|
}
|
||||||
};
|
|
||||||
|
|
||||||
module.exports = fibonacci;
|
module.exports = fibonacci;
|
||||||
|
|
Loading…
Reference in New Issue