forked from bloominstituteoftechnology/JavaScript-II-Mini
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrecursion.js
More file actions
49 lines (40 loc) · 1.03 KB
/
recursion.js
File metadata and controls
49 lines (40 loc) · 1.03 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
// to test these problems you can run 'node recursion.js' in your terminal
// Problem 1:
let n = 1;
while (n <= 10) {
console.log('While Loop', n);
++n;
}
// write a recursive - function called countToTen that mimics the while loop above.
// code here
const countToTen = (n) => {
if (n <= 10) {
console.log(n);
countToTen(++n);
}
};
countToTen(1);
// when you code is ready, un-comment the next line and run the file
// console.log(countToTen());
/* ================ Next Problem ================= */
// Problem 2:
const factorial = n => {
let result = 1;
for (let i = 2; i <= n; i++)
{
console.log(i);
result *= i;
}
return result;
};
console.log(factorial(5));
// write the above function in a recursive way.
// when your code is ready, un-comment the next line and run the file
const recursiveFactorial = n => {
if( n <= 1){
return 1;
} else{
return n * recursiveFactorial(--n); // make sure that you insert in --n because n-- is the n before decrement
}
}
console.log(recursiveFactorial(5));