Factorial by Recursion method
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 |
//factorial By Recuresion #include <iostream> using namespace std; int fact(int num){ if(num==0 || num ==1){ return 1; } int ans=num*fact(num-1); return ans; } int main(int argc, char const *argv[]) { int num; cout<<"Enter The NUmber Whose Factorial is to be find out"<<endl; cin>>num; int ans=fact(num); cout<<"Factorial of given Number is ::"<< ans <<endl; return 0; } |
2,076 total views, no views today
2,076 total views, no views today