👤

Create an algorithm that computes the factorial of a number N without using only loops in C++

Sagot :

//With Loop

#include <iostream>

int factorial(int n){

 int t = 1;

 for(int i=1; i<=n; i++){

   t *= i;

 }

 return t;

}

int main(){

 int inputNumber;

 std::cout << "Enter a number: ";

 std::cin >> inputNumber;

 std::cout << factorial(inputNumber);

 return 0;

}

---------------------------------------------------------------

// With recursion

#include <iostream>

int factorial(int n){

 if(n < 2){

   return 1;

 }

 return n * factorial(n-1);

}

int main(){

 int inputNumber;

 std::cout << "Enter a number: ";

 std::cin >> inputNumber;

 std::cout << factorial(inputNumber);

 return 0;

}