facto using recur
#include<stdio.h>
long factorial(int);
int main()
{
int n;
long f;
printf("Enter an integer to find factorial\n");
scanf("%d", &n);
if (n < 0)
printf("Negative integers are not allowed.\n");
else
{
f = factorial(n);
printf("%d! = %ld\n", n, f);
}
return 0;
}
long factorial(int n)
{
if (n == 0)
return 1;
else
return(n * factorial(n-1));
}
#include
ReplyDelete#include
void fact()
void main()
{
int num;
printf("enter a no");
scanf("%d",&num);
if(<fact<0 )
{
printf("dont find -ve no");
}
else
{
printf("%d",fact(num));
}
getch();
}
void fact(int num)
{
if(num==0)
{
return 1;
}
else
{
return (num*fact(num-1));
}
}
Exp 4 Factorial Using Recursion
ReplyDelete#include
#include
int fact(int i);
void main()
{
int n;
clrscr();
printf("\n \t Enter the Number:");
scanf("%d",&n);
if(n<0)
{
printf("\n \t Cant calculate Factrial:");
}
else
{
printf("\n \t Factorial of number=%d",fact(n));
}
getch();
}
int fact(int i)
{
if(i==0)
{
return 1;
}
else
{
return(i*fact(i-1));
}
}
/*factorial using recursion*/
ReplyDelete#include
#include
int fact(int i);
void main()
{
int n;
clrscr();
printf("\n \t Enter the Number:");
scanf("%d",&n);
if(n<0)
{
printf("\n \t Cant calculate Factrial:");
}
else
{
printf("\n \t Factorial of number=%d",fact(n));
}
getch();
}
int fact(int i)
{
if(i==0)
{
return 1;
}
else
{
return(i*fact(i-1));
}
}
/*factorial using recursion*/
ReplyDelete#include
#include
int fact(int i);
void main()
{
int n;
printf("\n \t Enter the Number:");
scanf("%d",&n);
if(n<0)
{
printf("\n \t Cant calculate Factrial:");
}
else
{
printf("\n \t Factorial of number=%d",fact(n));
}
}
int fact(int i)
{
if(i==0)
{
return 1;
}
else
{
return(i*fact(i-1));
}
}