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
37 lines (29 loc) · 887 Bytes
/
Copy pathrecursion.js
File metadata and controls
37 lines (29 loc) · 887 Bytes
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
// // 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
// // 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++) {
// result *= i;
// }
// return result;
// };
// console.log(factorial(5));
// write the above function in a recursive way.
const factorDis = (n) => {
if (n === 0) return 1;
console.log(n);
return n * factorDis(n - 1);
};
// when your code is ready, un-comment the next line and run the file
console.log(factorDis(0));