Scribd
Upload
5 views7 pages

Programms On Functions

The document provides examples of C programs demonstrating the use of functions for various tasks, including summing two numbers, calculating factorials using recursion, generating Fibonacci series, finding the GCD of two numbers, and calculating exponentiation recursively. Each example includes code snippets along with expected outputs. The programs illustrate fundamental programming concepts such as function declaration, recursion, and input/output operations in C.

Uploaded by

mschethan133
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views7 pages

Programms On Functions

The document provides examples of C programs demonstrating the use of functions for various tasks, including summing two numbers, calculating factorials using recursion, generating Fibonacci series, finding the GCD of two numbers, and calculating exponentiation recursively. Each example includes code snippets along with expected outputs. The programs illustrate fundamental programming concepts such as function declaration, recursion, and input/output operations in C.

Uploaded by

mschethan133
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Examples on Functions

[Link] a C program to find the sum of two numbers using Functions.


#include <stdio.h>
#include <conio.h>
int add(int a, int b); //function declaration
void main()
{
int a, b, sum;
clrscr();
printf("Enter two numbers to add \n");
scanf("%d %d", &a, &b);
sum=add(a,b); //function call & actual parameters
printf("\n sum=%d", sum);
getch();
}
i nt add(int a, int b) //function definition & formal parameters
{ int sum;
sum=a+b;
return sum; //return statement of function
}
Output:
Enter two numbers to add: 2 3
sum=5

[Link] using Recursion: Write a C Program to find factorial of


a given number using recursion.
#include <stdio.h>
#include <conio.h>
nt factorial(int);
void main()
{ intnum,fact;
clrscr();
printf(“Enter the number to find it’s factorial:”);
scanf(“%d”,&num);
if(num<0)
{
printf(“\nFactorial of negative number is not possible”);
}
else
{
fact=factorial(num);
printf(“The factorial of %d is %d”, num,fact);
}
getch();
}
int factorial(intnum)
{
if(num==0||num==1)
{
return 1;
}
else {
return(num*factorial(num-1));
}
}
Output:
Enter the number to find its factorial:5
The factorial of 5 is 120
[Link] Series using Recursion: Write a C Program to print
Fibonacci Series using recursion.
#include <stdio.h>
int Fibonacci(int Number)
{
if (Number ==0)
return 0;
else
if (Number==1)
return 1;
else
return(Fibonacci(Number-1)+Fibonacci(Number-2));
}
void main()
{
int Number, i=0;
printf("Please enter How many Fibonacci number to be displayed:\n ");
canf("%d",&Number);
printf("Fibonacci series are:\n");
for(i=0;i<Number;i++)
{
printf("%d\t", Fibonacci(i));
}
}
[Link] using Recursion: Write a C Program to find GCD of two
numbers using recursion.
#include <stdio.h>
int GCD(int, int);
void main()
{
int num1, num2, res;
printf("enter two numbers\n”);
scanf(“%d%d”,&num1,&num2);
res=GCD(num1, num2);
printf(“\n GCD of %d and %d = %d”, num1, num2, res);
getch();
}
intGCD(int x, int y)
{
int rem;
rem=x%y;
if(rem==0)
return y;
else
return (GCD(y,rem));
}
[Link] C Program to calculate exp(x,y) using recursion.
#include <stdio.h>
intexp_rec(int, int);
void main()
{
int num1, num2, res;
printf(“\nEnter two numbers”);
scanf(“%d%d”, &num1,&num2);
res=exp_rec(num1,num2);
printf(“\nRESULT=%d”,res);
getch();
}
intexp_rec(int x, int y)
{
if(y==0)
return 1;
else
return (x*exp_rec(x,y-1));
}

You might also like