RakeshMgs

Factorial of number using Recursion

 

Factorial of number using Recursion

#include <stdio.h> int find_factorial(int); int main() { int num, fact; //Ask user for the input and store it in num printf("\nEnter any integer number:"); scanf("%d",&num); //Calling our user defined function fact =find_factorial(num); //Displaying factorial of input number printf("\nfactorial of %d is: %d",num, fact); return 0; } int find_factorial(int n) { //Factorial of 0 is 1 if(n==0) return(1); //Function calling itself: recursion return(n*find_factorial(n-1)); }

output



เค†เคชเค•ो เค†เคฐ्เคŸिเค•เคฒ เค•ैเคธा เคฒเค—ा? เค…เคชเคจी เคฐाเคฏ เค…เคตเคถ्เคฏ เคฆें
Please don't Add spam links,
if you want backlinks from my blog contact me on rakeshmgs.in@gmail.com