-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrecursion.js
More file actions
47 lines (42 loc) · 1.13 KB
/
Copy pathrecursion.js
File metadata and controls
47 lines (42 loc) · 1.13 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
// Complete the following functions.
const nFibonacci = (n, tracker, num, prevNum) => {
// fibonacci sequence: 1 1 2 3 5 8 13 ...
// return the nth number in the sequence
// baseline
if (tracker === n) {
return num;
}
if (num === 0 && prevNum === 0) {
// console.log(++num);
// console.log(++prevNum);
tracker += 2;
return nFibonacci(n, tracker, num, prevNum);
}
const i = num;
num += prevNum;
prevNum = i;
// console.log (num);
return nFibonacci(n, ++tracker, num, prevNum);
};
// console.log('The fifth sequence in Fibonacci is ' + nFibonacci(5, 0, 0, 0));
const nFactorial = (n, runningNum = 1, tracker = 2) => {
// factorial example: !5 = 5 * 4 * 3 * 2 * 1
// return the factorial of `n`
if (tracker > n) {
return runningNum;
}
runningNum *= tracker;
return nFactorial(n, runningNum, ++tracker);
};
// console.log(nFactorial(6));
/* Extra Credit */
const checkMatchingLeaves = (obj) => {
// return true if every property on `obj` is the same
// otherwise return false
};
/* eslint-enable no-unused-vars */
module.exports = {
nFibonacci,
nFactorial,
checkMatchingLeaves,
};