recursion.js

// 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.
let countToten = function(){
let counter = 0;
 const loop = function(){
if(counter < 10){
  console.log(`While loop`, counter)
  return loop(counter++);
} 

 }//loop
 return loop();
};//countToTen

// 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.


let recursiveFactorial = function(n) {
  let result = 1;
  let counter = 2;
let loop = function(){
 if (counter > n) {
   return result;
 } else {
   result*=counter++;
   return loop(counter++);
 }
}//loop
return loop()
};

console.log(recursiveFactorial());










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