C Sample File : Function : Simple & Recursive
Function : Simple & Recursive
// Program To Find The Sum Of Two
Numbers By Using Function
#include<stdio.h>
#include<conio.h>
int sum(int,int);
void main()
{
int
n1,n2,res;
clrscr();
printf("Enter Any Two Numbers :
");
scanf("%d%d",&n1,&n2);
res=sum(n1,n2);
printf("\nSum Of %d + %d Is : %d",n1,n2,res);
getch();
}
int sum(int n1,int n2)
{
int s;
s=n1+n2;
return(s);
}
Output :
Enter
Any Two Numbers : 10 20
Sum
Of 10 + 20 Is : 30
// Program To Swap Two Numbers
Through Call By Value
#include<stdio.h>
#include<conio.h>
void swap(int,int);
void main()
{
int n1,n2;
clrscr();
printf("Enter Any Two Numbers
:");
scanf("%d%d",&n1,&n2);
printf("\nBefore Swaping Value Of
n1=%d & n2=%d\n",n1,n2);
swap(n1,n2);
getch();
}
void swap(int n1,int n2)
{
n1=n1+n2;
n2=n1-n2;
n1=n1-n2;
printf("\nAfter Swaping Value Of n1=%d
& n2=%d\n",n1,n2);
getch();
}
Output
:
Enter
Any Two Numbers :50 90
Before
Swaping Value Of n1=50 & n2=90
After
Swaping Value Of n1=90 & n2=50
// Program To Swap Two Numbers
Through Call By Reference
#include<stdio.h>
#include<conio.h>
void swap(int*,int*);
void main()
{
int n1,n2;
clrscr();
printf("Enter Any Two Numbers
:");
scanf("%d%d",&n1,&n2);
printf("\nBefore Swaping Value Of
n1=%d & n2=%d\n",n1,n2);
swap(&n1,&n2);
getch();
}
void swap(int *n1,int *n2)
{
*n1=(*n1)+(*n2);
*n2=(*n1)-(*n2);
*n1=(*n1)-(*n2);
printf("\nAfter
Swaping Value Of n1=%d & n2=%d\n",*n1,*n2);
}
Output :
Enter
Any Two Numbers :50 100
Before
Swaping Value Of n1=50 & n2=100
After
Swaping Value Of n1=100 & n2=50
// Program To Interchange Any Two
Rows Of A Matrix
By Passing Array To The Functions
#include<stdio.h>
#include<conio.h>
void change(int[][3]);
void main()
{
int
a[3][3],i,j;
clrscr();
printf("Enter 9 Elements In Of Matrix
:");
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
scanf("%d",&a[i][j]);
}
}
change(a);
getch();
}
void change(int a[3][3])
{
int
r1[3],r2[3],i,j,m=0,n=0;
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
if(i==0)
{
r1[m]=a[i][j];
m++;
}
else
if(i==1)
{
r2[n]=a[i][j];
n++;
}
}
}
m=0;
n=0;
printf("Your
Original Matrix Is :\n");
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
printf("%d ",a[i][j]);
}
printf("\n");
}
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
if(i==0)
{
a[i][j]=r2[m];
m++;
}
else
if(i==1)
{
a[i][j]=r1[n];
n++;
}
}
}
printf("\nYour Matrix After Row
Interchange Is :\n");
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
printf("%d ",a[i][j]);
}
printf("\n");
}
}
Output :
Enter 9 Elements In
Of Matrix :1 2 3 4 5 6 7 8 9
Your Original
Matrix Is :
1 2 3
4 5 6
7 8 9
Your Matrix After
Row Interchange Is :
4 5 6
1 2 3
7 8 9
// Program To Find Factorial Of a
Number Using Recursion
#include<stdio.h>
#include<conio.h>
int factorial(int);
void main()
{
int n;
clrscr();
printf("Enter Any Number :");
scanf("%d",&n);
printf("\nFactorial Of %d Is
%d",n,factorial(n));
getch();
}
int factorial(int n)
{
int f;
if(n==1)
{
return
n;
}
else
{
f=n*factorial(n-1);
return(f);
}
}
Output :
Enter
Any Number :5
Factorial
Of 5 Is 120
// Program To Calculate The Power
Of The Number By Using Recursinve
Function
#include<stdio.h>
#include<conio.h>
int pow(int,int);
void main()
{
int n,p;
clrscr();
printf("Enter Any Number :");
scanf("%d",&n);
printf("Enter Power You Want To find
:");
scanf("%d",&p);
printf("Calculation Of Power Is
=%d",pow(n,p));
getch();
}
int pow(int n,int p)
{
int pw;
if(p==0)
{
return
1;
}
else if(p==1)
{
return
n;
}
else
{
pw=n*pow(n,p-1);
return
pw;
}
}
Output :
Enter Any Number :2
Enter Power You
Want To find :3
Calculation Of
Power Is =8
Comments
Post a Comment