You are on page 1of 13

C

PROGRAMS
ASSIGNMENT

Done by :-
Varun malik
185549
CSE (DUAL)
/*WRITE A PROGRAM TO CALCULATE POWER OF A NUMBER */

CODE :

#include<stdio.h>
int power(int x, unsigned int y)
{
if (y == 0)
return 1;
else if (y%2 == 0)
return power(x, y/2)*power(x, y/2);
else
return x*power(x, y/2)*power(x, y/2);
}

/* Program to test function power */


int main()
{
int x = 2;
unsigned int y = 3;

printf("%d", power(x, y));


return 0;
}

OUTPUT :

1
/*WRITE A PROGRAM TO CALCULATE
DIAMETER,CIRCUMFRENCE,AREA WITH RADIUS OF CIRCLE*/

CODE :

#include<stdio.h>
#define pi 3.14159
/* Function to calculate x raised to the power y */
void circle(float r)
{
printf(" diameter of circle %f\n",2*r);
printf("circumfrence of circle %f\n", 2*pi*r);
printf("area of circle %f", r*pi*r);
}

/* Program to test function power */


int main()
{
float a=5.2;
circle(a);
return 0;
}

OUTPUT :

2
/* WRITE A PROGRAM TO SWAP VALUES OF X AND Y VIA CALL
BY VALUE METHOD */

CODE :
#include<stdio.h>
void swapv(int x, int y)
{
int t;
t=x;
x=y;
y=t;
}
int main()
{
int x = 2;
int y = 3;

printf("x=%d y=%d\n",x, y);


swapv(x,y);
printf("after swap\n x=%d y=%d",x, y);
return 0;
}

OUTPUT :

3
/* WRITE A PROGRAM TO SWAP VALUES OF X AND Y VIA CALL
BY REFRENCE METHOD*/

CODE :
#include<stdio.h>
void swapr(int &x, int &y)
{
int t;
t=x;
x=y;
y=t;
}
int main()
{
int x = 2;
int y = 3;

printf("x=%d y=%d\n",x, y);


swapr(x,y);
printf("after swap\n x=%d y=%d",x, y);
return 0;
}

OUTPUT :

4
/* WRITE A PROGRAM TO CALCULATE FACTORIAL OF A
NUMBER*/

CODE :

#include <stdio.h>
long int fac(int n)
{
if (n >= 1)
return n*fac(n-1);
else
return 1;
}

int main()
{
int n;
printf("Enter a positive integer: ");
scanf("%d", &n);
printf("Factorial of %d = %ld", n,fac(n));
return 0;
}

OUTPUT :

5
/* WRITE A PROGRAM TO PRINT FIBONACCI NUMBERS UPTO A
NUMBER N */

CODE :
#include<stdio.h>
int fibb(int n)
{
if ( n == 0 )
return 0;
else if ( n == 1 )
return 1;
else
return ( fibb(n-1) + fibb(n-2) );
}

int main()
{
int n, i = 0;
scanf("%d",&n);
printf("Fibonacci series\n");
while (fibb(i)<n)
{
printf("%d\n", fibb(i));
i++;
}
return 0;
}

OUTPUT :

6
/*WRITE A PROGRAM TO CALCULATE SUM OF DIGITS OF A
NUMBER */

CODE :
#include <stdio.h>
int sum (int num)
{
if (num != 0)
{
return (num % 10 + sum (num / 10));
}
else
{
return 0;
}
}
int main()
{
int num;
printf("Enter the number: ");
scanf("%d", &num);
printf("Sum of digits in %d is %d\n", num, sum(num));
return 0;
}

OUTPUT :

7
/*WRITE A PROGRAM TO BINNARY SORT AN ARRAY */
CODE :
#include <stdio.h>
int main()
{
int c, first, last, middle, n, search, array[100];
printf("Enter number of elements\n");
scanf("%d",&n);
for (c = 0; c < n; c++)
scanf("%d",&array[c]);
printf("Enter value to find\n");
scanf("%d", &search);
first = 0;
last = n - 1;
middle = (first+last)/2;
while (first <= last)
{
if (array[middle] < search)
first = middle + 1;
else if (array[middle] == search)
{
printf("%d found at location %d.\n", search, middle+1);
break;
}
else
last = middle - 1;
middle = (first + last)/2;}
if (first > last)
printf("Not found! %d isn't present in the list.\n", search);
return 0;
}
OUTPUT :

8
/*

WRITE A PROGRAM TO BUBBLE SORT AN ARRAY */

CODE :

#include <stdio.h>
Int main()
{
int i,j,x;
int a[5]={5,2,3,4,1};
for(i=0;i<5;i++) {
for(j=i+1;j<5;j++) {
if(a[i]>a[j]) {
x=a[i];
a[i]=a[j];
a[j]=x;
}
}
}
int k;
for(k=0;k<5;k++) {printf("%d ",a[k]);} printf("\n");
return 0;
}

OUTPUT :

9
/* WRITE A PROGRAM TO SELECTION SORT AN
ARRAY*/
CODE :

#include <stdio.h>
int main()
{
int i,j,x,min,k;
int a[5]={5,3,2,4,1};
for(i=0;i<5;i++) {
min=i;
for(j=i+1;j<5;j++) {
if(a[min]>a[j]) {
min=j;
}
x=a[min];
a[min]=a[j];
a[j]=x;
} }
for(k=0;k<5;k++) {printf("%d ",a[k]);}
printf("\n");
return 0;
}

OUTPUT :

10
/* WRITE A PROGRAM TO INSERTION SORT AN
ARRAY*/
CODE :
#include <stdio.h>
main()
{
int i,j,key;
int a[5]={5,2,4,3,1};
for(i=1;i<5;i++)
{
key=a[i];
while(i>0 && a[i-1]>key) {
j=a[i];
a[i]=a[i-1];
a[i-1]=j;
--i;
}
}
int k;
for(k=0;k<5;k++)
{printf("%d ", a[k]);}
printf("\n");
}

11
OUTPUT :

12

You might also like