-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrecursion.js
More file actions
66 lines (57 loc) · 1.7 KB
/
recursion.js
File metadata and controls
66 lines (57 loc) · 1.7 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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
// Complete the following functions.
const nFibonacci = (n) => {
if (n <= 1) return 1;
return nFibonacci(n - 1) + nFibonacci(n - 2);
};
const nFactorial = (n) => {
if (n === 0) return 1;
return n * nFactorial(n - 1);
};
/* Extra Credit */
/* Stretch Alogorithm */
const checkMatchingLeaves = (obj) => {
// initialize some value...
// initialize some flag.. boolean.
// initialize some helper function and pass obj... leaf checker recursive function
// check all the keys = this is a hint......for loop of some kind
// if a key is an object && initial value is undef
// assign value
// if a value is an object ==> recurse
// if a value is found, and it doesn't match our initial value
// trip our flag to false
// return;
// return true/false
};
const checkMatchingLeaves = (obj) => {
// return true if every property on `obj` is the same
// otherwise return false
const flatObj = Object.values(obj);
let i = 0;
if (i > checker.length) return; // base case = all props compared
if // test all props of top level obj, return false if any != (IE prop[i] == prop[i+1])
// test all props of nested obj, return false if any !=
};
/*
const checkMatchingLeaves = (obj) => {
// return true if every property on `obj` is the same
// otherwise return false
const index = 0;
const objArray = Object.values(obj);
const testFunction = (arr, i) => {
while (i < arr.length - 1) {
if (arr[i] !== arr[++i]) {
return false;
}
return testFunction(arr, i++);
}
return true;
};
return testFunction(objArray, index);
};
*/
/* eslint-enable no-unused-vars */
module.exports = {
nFibonacci,
nFactorial,
checkMatchingLeaves,
};