c programs with index

8/6/2019 C Programs With Index

1/51

Design and Analysis of Algorithms

Index

S. No. Contents Page No.

1. Bubble Sort Implementation 2

2. Selection Sort Implementation 3

3. Insertion Sort Implementation 5

4. Quick Sort Implementation 6

5. Merge Sort Implementation 8

6. Heap Sort Implementation 10

7. Comparison Counting Sort Implementation 12

8. Sequential Search Implementation 14

9. Quick Sequential Search Implementation 16

10. Binary Search Implementation 18

11. Brute Force Pattern Matching Technique 20

12. Brute Force Technique for finding closest points 21

13. Matrix Multiplication 23

14. Matrix Chain Multiplication 25

15. Coin Problem using Greedy Strategy 26

16. Coin Problem using Dynamic Programming 28

17. Knap Sack Problem 30

18. Prim Algorithm Implementation 31

19. Breadth First Search Implementation 35

20. N-Queen problem using Backtracking 37

21. Subset Problem Using Backtracking39

22. N-Queen Problem using FIFO Branch & Bound 41

23. Calculating Factorial 44

24. Exponential xn 45

25. Euclid Algorithm Implementation 46

26. Fibonacci numbers using Dynamic Programming 47

27. Sub Set Problem using FIFO Branch and Bound Technique 48

]

****************************

SCS DAVV, INDORE 1


2/51


1. Program for Bubble Sort Implementation

#include#include

#include

void BubbleSort(int *a,int n);int n;

int *a;

void readData();void display();

int main()

{

clrscr();readData();

BubbleSort(a,n);

display();

free(a);getch();

return 0;}

void readData()

{

coutn;

a=(int*)malloc(sizeof(int)*(n));

cout


3/51


2. Program for Selection Sort Implementation

#include#include

#include

void selectionSort(int *a);int n;

int *a;


int main()

{

clrscr();

readData();

selectionSort(a);

display();free(a);

getch();

return 0;

}

void readData()

{

coutn;

a=(int*)malloc(sizeof(int)*(n+1));

cout


4/51


for(int j=i+1;j


5/51


3. Program for Insertion Sort Implementation

#include#include

#include

void insertionSort(int *a);int n, *a;

void readData();

void display();int main()

{

clrscr();

readData();insertionSort(a);

display();

free(a);

return 0;}

void readData(){

coutn;

a=(int*)malloc(sizeof(int)*(n+1));cout


6/51


4. Program for Quick Sort Implementation

#include#include

#include

void quickSort(int *a, int p , int r);int partition(int *a,int p, int r);

int n;

int *a;void readData();

void display();

int main()

{clrscr();

readData();

quickSort(a,1,n);display();

free(a);getch();

return 0;

}

void readData(){

coutn;a=(int*)malloc(sizeof(int)*(n+1));

cout


7/51


int partition(int *a,int p, int r)

{int x=a[r];

int i=p-1;

for(int j=p;j


8/51


5. Program for Merge Sort Implementation

#include#include

#include

void mergeSort(int *a, int p , int r);void merge(int *a,int p,int q, int r);

int n;

int *a;void readData();

void display();

int main()

{clrscr();

readData();

mergeSort(a,1,n);display();

free(a);getch();

return 0;

}

void readData(){

coutn;a=(int*)malloc(sizeof(int)*(n+1));

cout


9/51


10/51


6. Program for Heap Sort Implementation

#include#include

#include

void heapSort(int *a);void buildMaxHeap(int *a);

void maxHeapify(int *a, int i);

int n;int *a;

int heapSize;

void readData();


{

clrscr();

readData();

heapSort(a);display();

free(a);

getch();

return 0;

}

void readData()

{coutn;

a=(int*)malloc(sizeof(int)*(n+1));cout


11/51


for(int i=n;i>=2;i--)

{

a[1]^=a[i]^=a[1]^=a[i];heapSize--;

maxHeapify(a,1);

}}

void buildMaxHeap(int *a)

{

heapSize=n;

for(int i=n/2;i>=1;i--)maxHeapify(a,i);

}

void maxHeapify(int *a, int i){

int l=2*i;int r=2*i+1;

int largest;

if(la[i])

largest=l;else

largest=i;

if(ra[largest])

largest=r;

if(largest!=i)

{

a[i]^=a[largest]^=a[i]^=a[largest];maxHeapify(a,largest);

}

}

SCS DAVV, INDORE 11


12/51


7. Program for Comparison Counting Sort Implementation

#include#include

#include

int *comparisionCountingSort(int *a,int n);int n;

int *a;

void readData();void display(int *a);

int main()

{

clrscr();

readData();

int *s=comparisionCountingSort(a,n);

display(s);free(a);

getch();

return 0;

}

void readData()

{coutn;

a=(int*)malloc(sizeof(int)*(n));cout


13/51


for( i=0;i


14/51


8. Program for Sequential Search Implementation

#include#include

#include

int search(int);int *a,n;

void readData();


{

clrscr();

int key;

readData();

coutkey;

cout


15/51


int i=0;

while(i


16/51


9. Program for Quick Sequential Search Implementation

#include#include

#include

int search(int);int *a,n;

void readData();


{

clrscr();

int key;

readData();

coutkey;

cout


17/51


{

int i=0;a[n]=key;

while(a[i]!=key)

i++;return i==n?-1:i+1;

}

SCS DAVV, INDORE 17


18/51


10. Program for Binary Search Implementation

#include#include

#include

void binarySearch(int low,int high,int key);int *a,n,found;

int mid;


int main()

{

clrscr();int key;

readData();

coutkey;binarySearch(0,n,key);

if(found)

cout


19/51


cout


20/51


21/51


12. Program for finding closest points using Brute Force Technique

#include#include

#include

#include#define MAX 10

struct point

{int x;

int y;

};

void bruteForceClosestPoint(point *p,float *minDis,int *index1,int *index2);

int n;

void main()

{point p[MAX];

coutn;

cout


22/51


if(d


23/51


13. Program for Matrix Multiplication

#include#include

#include

#define MAX 5void matrixMultiply(int *a[MAX],int rowa, int cola,int *b[MAX], int rowb, int colb);

void readData(int *a[MAX],int row, int col);

void display(int *b[MAX],int row,int col);int main()

{

clrscr();

int *a[MAX],*b[MAX];int row1,row2,col1,col2;

coutrow1>>col1;

coutrow2>>col2;

if(col1==row2)

{

cout


24/51


for(int j=0;j


25/51


14. Program for Matrix Chain Multiplication

#include#include

int p[100],q;

long f(int i,int j) /*i stands for position of first matrix,j stands of last matrix*/{ long m;

int k,q;

if(i==j)return 0;

m=32099007;

for(k=i;k


26/51


15. Program for returning change for given amt using Greedy Strategy

#include#include

int coins[]={100,25,10,5,2,1};

int s[25];int* make_change(int amt);

int i=0;

void main(){

clrscr();

int amt;

coutamt;

int *sol=make_change(amt);

cout


27/51


else{

if(n>=1)

{ s[i++]=1;n=n-1;

}

}

}

}

}

}

return s;}

SCS DAVV, INDORE 27


28/51


16. Program for finding minimum number of coins required for returning given amount

using Dynamic Programming.

#include

#include

#define MAX 3

int C[4][100];

int d[4]={0,1,4,6};

int f(int,int);

void main(){

clrscr();

for(int i=0;i


29/51


{

C[i][j]=1+f(i,j-d[i]);

return(C[i][j]);}

if(j


30/51


17. Program for Knap Sack Problem

#include#include

int n=3;

float M=20;float P[4];

float W[4];

float X[4];void knapsack();

void result();

void main()

{clrscr();

P[1]=24; P[2]=15; P[3]=25;

W[1]=15; W[2]=10; W[3]=18;

knapsack();result();

getch();}

void knapsack()

{

float cu = M;int i=1;

while(icu)

break;

X[i]=1;cu=cu-W[i];

i++;

}if(i


31/51


32/51


for( pp=1;pp


33/51


j++;

goto cc;

}//ifj


34/51


35/51


19. Program for Breadth First Search Implementation

#include#include

char c[6];

int d[6],p[6],n[6],k=0,l=1,s,q[20],pos;int z=1;

void que(int);

int t[6][6]={{0,0,0,0,0,0},{0,0,1,1,0,0},

{0,1,0,0,1,0},

{0,1,0,0,1,1},

{0,0,1,1,0,1},{0,0,0,1,1,0}};

void main()

{ for(int i=1;i


36/51


printf("c[%d]=%c , d[%d]=%d , p[%d]=%d\n",ii,c[ii],ii,d[ii],ii,p[ii]);

}

for( ii=1;ii


37/51


20. Program for solving N-Queen problem using Backtracking

#include#include

#define MAX 4

int queen(int);int conflict(int);

int result[9];

void main(){clrscr();

if(queen(1))

{

for(int i=1;i


38/51


int conflict(int level)

{int m,n,p;

m=n=p=result[level];

for(int i=level-1;i>=1;i--)

{

if((result[i]==++m)||(result[i]==--n)||(result[i]==p))return 1;

}

return 0;

}

SCS DAVV, INDORE 38


39/51


21. Program for Subset Problem Using Backtracking

#include#include

#include

#define MAX 5int setResult(int);

int check(int);

int result[9];int result1[9];

int sum,sum1=0;

int set[9];

void main(){clrscr();

cout


40/51


41/51


22. Program for Solving N-Queen Problem using FIFO Branch and Bound Technique

#include#include

#define MAX 50

#define M 5class state

{

public:int result[M];

int level;

};

class queue{

int front,rear;

state a[MAX];

public:queue()

{front=-1;

rear=0;

}

void add(state x){

if(front==-1)

front=0;if(rear==MAX-1)

cout


42/51


front=-1;

rear=0;

}return x;

}

};

state queen();

int conflict(state x);void main()

{

clrscr();

state x=queen();if(x.level==-1)

cout


43/51


}

a.level=-1;

return a;}

int conflict(state x){

int m,n,p;

m=n=p=x.result[x.level];

for(int i=x.level-1;i>=1;i--)

{

if((x.result[i]==++m)||(x.result[i]==--n)||(x.result[i]==p))return 1;

}

return 0;

}

SCS DAVV, INDORE 43


44/51


23. Program for calculating Factorial

#include#include

int fact(int);

int main(){

clrscr();coutn;

cout


45/51


24. Program for calculating Power(X,N)

#include#include

int exp(int,int);

int main()

{clrscr();

coutx;coutn;

cout


46/51


25. Program for finding GCD of two numbers using Euclid Algorithm

#include#include

void gcdByEuclid(int,int);void main()

{

clrscr();

int x,y;

printf("\n Enter the first Number :\n");

scanf("%d",&x);printf("\n Enter the second number :\n");

scanf("%d",&y);

gcdByEuclid(x,y);

getch();}

void gcdByEuclid(int x, int y)

{

int remainder, dividend, divisor;

dividend =x,divisor = y;

remainder = dividend % divisor;

while (remainder > 0){

dividend=divisor;

divisor =remainder;remainder =dividend % divisor;

}

printf("\n The GCD of input is :");printf("%d",divisor);

}

SCS DAVV, INDORE 46


47/51


48/51


27. Program for solving Sub Set Problem using FIFO Branch and Bound Technique

#include#include

#include

#define MAX 100#define M 6

class state

{public:

state();

int result[M];

int level;};

state::state()

{

for(int i=1;i


49/51


state remove()

{state x;

x=a[front++];

if(rear==front){

front=-1;

rear=0;}

return x;

}

};

state SetResult();

int conflict(state x);

int result1[9];int sum,sum1=0;

int set[9];void main(){

clrscr();

cout


50/51


queue b;

b.add(a);

while(!(b.empty())){

x=b.remove();

x.level++;i=1;

while(i


51/51


for(i=1;i sum)

return 1;

return 0;

}

****************************

c programs with index

Documents