Skip to content

nour hassan js-II-mini #24

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
nourmhassan wants to merge 2 commits into
base: master
Choose a base branch
from
Open

nour hassan js-II-mini #24

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
31b2dd4
nour hassan
nourmhassan Feb 23, 2018
9f9943b
nour hassan js-mini fixed
nourmhassan Feb 25, 2018
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 12 additions & 2 deletions recursion.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,9 +10,14 @@ while (n <= 10) {
// write a recursive - function called countToTen that mimics the while loop above.

// code here
const countToTen = num => {
if (num > 10) return;
console.log(`while loop ${num}`);
countToTen(++num)
};

// when you code is ready, un-comment the next line and run the file
// console.log(countToTen());
console.log(countToTen(1));
/* ================ Next Problem ================= */

// Problem 2:
Expand All @@ -28,6 +33,11 @@ const factorial = n => {
console.log(factorial(5));

// write the above function in a recursive way.
const recursiveFactorial = n => {
if (n === 0) return 1;
return n * recursiveFactorial(n - 1);
};


// when your code is ready, un-comment the next line and run the file
// console.log(recursiveFactorial());
console.log(recursiveFactorial(5));