Dev Bhoomi Institute Of Technology. Department of Computer Application EXPERIMENT NO. ISSUE NO. : ISSUE DATE: REV. NO. : REV.

Transcription

1 LIST OF PRACTICALS 1. Matrix Operations-Add and Multiply 2. String Operations strlen(), strcat() etc. 3. Stack operations using Arrays. 4. Implementing Polish Notations using Stacks. 5. Evaluating postfix notation. 6. Queues operations using Arrays. 7. Circular queue using arrays. 8. Dequeue using array. 9. Self-referential structures & single linked list operations 10. Implementing Stack using linked lists. 11. Implementing Queue using linked lists. 12. Self-referential structures &doubly linked list operations 13. LinearSearch. 14. Binary Search 15. Selection Sort. 16. Bubble Sort. 17. Insertion sort.

2 18. Merge sort. 19. Quick sort. 20. Radix (bucket) sort method. 21. Binary Search Tree operations. 22. Heap sort & AVL tree implementations. 23. Write a program in C for DFS

3 1. Matrix Operations-Add and Multiply /* Addition */ #include<stdio.h> #include<conio.h> int main() int m, n, i, j, first[10][10], second[10][10], sum[10][10]; printf("enter the number of rows and columns of matrix\n"); scanf("%d%d", &m, &n); printf("enter the elements of first matrix\n"); for (i = 0; i< m; i++) for (j = 0; j< n; j++) scanf("%d", &first[i][j]); printf("enter the elements of second matrix\n"); for (i = 0; i< m; i++) for (j = 0; j< n; j++) scanf("%d", &second[i][j]); printf("sum of entered matrices:-\n"); for (i = 0; i< m; i++) for (j = 0; j< n; j++) sum[i][j] = first[i][j] + second[i][j]; printf("%d\t", sum[i][j]); printf("\n"); return 0;

4 /* Multiplication */ #include <stdio.h> int main() int m, n, p, q, i, j, k, sum = 0; int first[10][10], second[10][10], multiply[10][10]; printf("enter the number of rows and columns of first matrix\n"); scanf("%d%d", &m, &n); printf("enter the elements of first matrix\n"); for (i = 0; i< m; i++) for (j = 0; j< n; j++) scanf("%d", &first[i][j]); printf("enter the number of rows and columns of second matrix\n"); scanf("%d%d", &p, &q); if (n!= p) printf("matrices with entered orders can't be multiplied with each other.\n"); printf("enter the elements of second matrix\n"); for (i = 0; i< p; i++) for (j = 0; j< q; j++) scanf("%d", &second[i][j]); for (i = 0; i< m; i++) for (j = 0; j< q; j++) for (k = 0; k < p; k++) sum = sum + first[i][k]*second[k][j];

5 multiply[i][j] = sum; sum = 0; printf("product of entered matrices:-\n"); for (i = 0; i< m; i++) for (j = 0; j< q; j++) printf("%d\t", multiply[i][j]); printf("\n"); return 0;

6 2. String Operations strlen(), strcat() etc. #include <stdio.h> #include <string.h> int main() char a[20]="program"; char b[20]='p','r','o','g','r','a','m','\0'; char c[20]; printf("enter string: "); gets(c); printf("length of string a = %d \n",strlen(a)); //calculates the length of string before null charcter. printf("length of string b = %d \n",strlen(b)); printf("length of string c = %d \n",strlen(c)); return 0; #include <stdio.h> #include <string.h> int main()

7 char str1[10]= "awesome"; char str2[10]; char str3[10]; strcpy(str2, str1); strcpy(str3, "well"); puts(str2); puts(str3); return 0; #include <stdio.h> #include <string.h> int main() char str1[] = "This is ", str2[] = "programiz.com"; //concatenates str1 and str2 and resultant string is stored in str1. strcat(str1,str2); puts(str1); puts(str2);

8 return 0; #include <stdio.h> #include <string.h> int main() char str1[] = "This is ", str2[] = "dbgidoon.ac.in"; //concatenates str1 and str2 and resultant string is stored in str1. strcat(str1,str2); puts(str1); puts(str2); return 0; #include <stdio.h> #include <string.h> int main() char str1[] = "abcd", str2[] = "abcd", str3[] = "abcd";

9 int result; // comparing strings str1 and str2 result = strcmp(str1, str2); printf("strcmp(str1, str2) = %d\n", result); // comparing strings str1 and str3 result = strcmp(str1, str3); printf("strcmp(str1, str3) = %d\n", result); return 0;

10 3. Stack operations using Arrays. #include<stdio.h> #include<conio.h> #include<stdlib.h> #define MAX 10 struct stack int items[max]; int top; ; typedef struct stack st; void createemptystack(st *s) s->top=-1; int isfull(st *s) if (s->top==max-1) return 1;

11 return 0; int isempty(st *s) if (s->top==-1) return 1; return 0; void push(st *s) int newitem; printf("enter item to be inserted: "); scanf("%d",&newitem); if (isfull(s)) printf("stack FULL"); s->top++; s->items[s->top]=newitem;

12 void pop (st *s) if (isempty(s)) printf("\n STACK EMPTY \n"); printf("item popped= %d",s->items[s->top]); s->top--; void main() int ch; int loop; loop=1; st *s;

13 createemptystack(s); do printf("\n ***STACK OPERATIONS"); printf("\n 1. PUSH"); printf("\n 2. POP"); printf("\n 3. EXIT"); printf("\n ***************"); printf("\n Enter your choice: "); scanf("%d", &ch); switch (ch) case 1: push(s); break; case 2: pop(s); break; case 3: printf("thank YOU"); loop=0; exit(0);

14 default: printf("invalid choice"); while(loop); getch();

15 4. Implementing Polish Notations using Stacks. #include<stdio.h> #include<conio.h> #include<stdlib.h> #include<ctype.h> char Stack[25]; //Operator stack int top; char Infix[25],Postfix[25]; void Convert() int i=0,j=0; while(infix[i]!=0) char ch=infix[i++]; if(isalpha(ch)) Postfix[j++]=ch; while(top!=-1&&precedence(stack[top],ch)) Postfix[j++]=Stack[top--]; if(top==-1 ch!=')') Stack[++top]=ch; while(top!=-1) char c=stack[top--]; if(c!='(') Postfix[j++]=c; Postfix[j]='\0';

16 int Precedence(char top,char cur) if(top!='('&&cur==')') return 1; if((top=='$' top=='*' top=='/')&&(cur=='*' cur=='/' cur=='+' cur=='-')) return 1; if((top=='+' top=='-')&&(cur=='+' cur=='-')) return 1; return 0; void main() clrscr(); top=-1; printf("\n\n\t\tenter the Valid Infix Expression: "); scanf("%s",infix); Convert(); printf("\n\n\t\tthe Infix Expression : %s",infix); printf("\n\n\t\tthe Postfix Expression : %s",postfix); getch(); OUTPUT Enter the Valid Infix Expression: (a+b * c) / (d$e) The Infix Expression : (a+b * c) / (d$e) The Postfix Expression : abc*+de$/

17 5. Evaluating postfix notation. #include<stdio.h> #include<conio.h> #include<stdlib.h> #include<ctype.h> #include<math.h> float Stack[25]; //Operand Stack... int top; char Postfix[25]; int flag; float Evaluate() int i=0; while(postfix[i]!='\0') char ch=postfix[i++]; if(isalpha(ch)) printf("\n\n\tenter value of %c: ",ch); scanf("%f",&stack[++top]); if(top<1) flag=0; float op1,op2; op2=stack[top--]; op1=stack[top--]; switch(ch) case '+': Stack[++top]=op1+op2; break; case '-': Stack[++top]=op1-op2; break;

18 case '*': Stack[++top]=op1*op2; break; case '/': Stack[++top]=op1/op2; break; case '$': case '^': Stack[++top]=pow(op1,op2); break; default: printf("\n\n\tinvalid Character: %c",ch); flag=0; if(top!=0) flag=0; return( Stack[top--]); void main() float result; clrscr(); top=-1; flag=1; printf("\n\n\n\t\tenter the Valid Postfix Expression: "); scanf("%s",postfix); result=evaluate(); printf("\n\n\tinvalid Postfix Expression..."); if(flag==1) printf("\n\n\tthe Result of Postfix Expression %s is: %.3f",Postfix,result); getch(); OUTPUT Enter the Valid Postfix Expression: ab+c/ Enter value of a: 4

19 Enter value of b: 2 Enter value of c: 3 The Result of Postfix Expression ab+c/ is: 2.000

20 6. Queues operations using Arrays. #include<stdio.h> #include<conio.h> #define SIZE 10 void enqueue(int); void dequeue(); void display(); int queue[size], front = -1, rear = -1; void main() int value, choice; clrscr(); while(1) printf("\n\n***** MENU *****\n"); printf("1. Insertion\n2. Deletion\n3. Display\n4. Exit"); printf("\nenter your choice: "); scanf("%d",&choice); switch(choice) case 1: printf("enter the value to be insert: "); scanf("%d",&value); enqueue(value);

21 break; case 2: dequeue(); break; case 3: display(); break; case 4: exit(0); default: printf("\nwrong selection!!! Try again!!!"); void enqueue(int value) if(rear == SIZE-1) printf("\nqueue is Full!!! Insertion is not possible!!!"); if(front == -1) front = 0; rear++; queue[rear] = value; printf("\ninsertion success!!!"); void dequeue() if(front == rear) printf("\nqueue is Empty!!! Deletion is not possible!!!");

22 printf("\ndeleted : %d", queue[front]); front++; if(front == rear) front = rear = -1; void display() if(rear == -1) printf("\nqueue is Empty!!!"); int i; printf("\nqueue elements are:\n"); for(i=front; i<=rear; i++) printf("%d\t",queue[i]);

23 7. Circular queue using arrays. #include <stdio.h> #define SIZE 5 int items[size]; int front = -1, rear =-1; int isfull() if( (front == rear + 1) (front == 0 && rear == SIZE-1)) return 1; return 0; int isempty() if(front == -1) return 1; return 0; void enqueue(int element) if(isfull()) printf("\n Queue is full!! \n");

24 if(front == -1) front = 0; rear = (rear + 1) % SIZE; items[rear] = element; printf("\n Inserted -> %d", element); int dequeue() int element; if(isempty()) printf("\n Queue is empty!! \n"); return(-1); element = items[front]; if (front == rear) front = -1; rear = -1; /* Q has only one element, so we reset the queue after dequeing it.? */ front = (front + 1) % SIZE;

25 printf("\n Deleted element -> %d \n", element); return(element); void display() int i; if(isempty()) printf(" \n Empty Queue\n"); printf("\n Front -> %d ",front); printf("\n Items -> "); for( i = front; i!=rear; i=(i+1)%size) printf("%d ",items[i]); printf("%d ",items[i]); printf("\n Rear -> %d \n",rear); int main()

26 // Fails because front = -1 dequeue(); enqueue(1); enqueue(2); enqueue(3); enqueue(4); enqueue(5); // Fails to enqueue because front == 0 && rear == SIZE - 1 enqueue(6); display(); dequeue(); display(); enqueue(7); display(); // Fails to enqueue because front == rear + 1 enqueue(8); return 0;

27 8. Dequeue using array. #include<stdio.h> #include<conio.h> #include<stdlib.h> #define MAX 10 int q[max],front=0,rear=0; void add_rear(); void add_front(); void delete_rear(); void delete_front(); void display(); void main() int ch; clrscr(); do //clrscr(); printf("\n DQueue Menu"); printf("\n ");

28 printf("\n 1. AddRear"); printf("\n 2. AddFront"); printf("\n 3. DeleteRear"); printf("\n 4. DeleteFront"); printf("\n 5. Display"); printf("\n 6. Exit"); printf("\n "); printf("\n Enter your choice:-"); scanf("%d",&ch); switch(ch) case 1: add_rear(); printf("\n Queue after insert at rear"); display(); break; case 2: add_front(); printf("\n Queue after insert at front");

29 display(); break; case 3: delete_rear(); printf("\n Queue after delete at rear"); display(); break; case 4: delete_front(); printf("\n Queue after delete at front"); display(); break; case 5: display(); break;

30 case 6: default: while(ch!=6); exit(0); break; printf("\n Wrong Choice\n"); void add_rear() int no; printf("\n Enter value to insert : "); scanf("%d",&no); if(rear==max) printf("\n Queue is Overflow"); return;

31 rear++; q[rear]=no; if(rear==0) rear=1; if(front==0) front=1; void add_front() int no; printf("\n Enter value to insert:-"); scanf("%d",&no); if(front<=1) printf("\n Cannot add value at front end"); return; front--; q[front]=no;

32 void delete_front() int no; if(front==0) printf("\n Queue is Underflow\n"); return; no=q[front]; printf("\n Deleted element is %d\n",no); if(front==rear) front=0; rear=0; front++;

33 void delete_rear() int no; if(rear==0) printf("\n Cannot delete value at rear end\n"); return; no=q[rear]; if(front==rear) front=0; rear=0; rear--; printf("\n Deleted element is %d\n",no);

34 void display() int i; if(front==0) printf("\n Queue is Underflow\n"); return; printf("\n Output"); for(i=front;i<=rear;i++) printf("\n %d",q[i]);

35 9. Self-referential structures & single linked list operations. #include<stdio.h> #include<stdlib.h> Typedef struct nodetype int info; struct node *next; Node; Void CreateEmptyList(Node **s) *s=null; Void InsertatBegininning(Node **s) int item; Node *temp; printf( \n enter the item to insert : ); scanf( %d,&item); temp=(node*)malloc(sizeof(node)); temp->info=item;

36 if(*s==null) temp->next=null; temp->next=*s; *s=temp; void InsertatEnd(Node **s) int item; Node *temp,*current; printf( \n enter the item to insert : ); scanf( %d,&item); temp=(node*)malloc(sizeof(node)); temp->info=item; temp->next=null; if(*s==null) *s=null; current=*s; while(current->next!=null) current=current->next; current->next=temp;

37 void InsertAfter(Node **s) int item,after; Node *temp,*current; printf( \n enter the item to insert : ); scanf( %d,&item); printf( \n enter the afterelement : ); scanf( %d,&after); current=*s; while(current->info!=after && current!=null) current=current->next; if(current==null) printf( \n operation not possible ); temp=(node*)malloc(sizeof(node)); temp->info=item; temp->next=current->next; current->next=temp;

38 void DeletefromStart(Node **s) Node *temp; If(*s==NULL) Printf( \n list is empty ); temp=*s; *s=temp->next; free(temp); void DeletefromEnd(Node **s) Node *temp,*current; If(*s==NULL) Printf( \n list is empty ); if((*s)->next==null) temp=*s; *s=null; free(temp);

39 current=*s; temp=current->next; while(temp->next!=null) current=temp; temp=temp->next; current->next=null; free(temp); void DeleteAfter(Node **s) int after; Node *temp,*loc; printf( \n enter the after element : ); scanf("%d",&after); If(*s==NULL) Printf( \n list is empty );

40 loc=*s; while(loc->info!=after && loc!=null) loc=loc->next; if(loc==null) printf("\n after element not present"); temp=loc->next; loc->next=temp->next; free(temp) ; void DeleteEntireList(Node **s) Node *temp; while(*s!=null) temp=*s; *s=(*s)->next; free(temp);

41 void Display(Node **s) Node *temp; printf("\n\n") if(*s==null) printf("list is empty"); temp=*s; while(temp!=null); printf("%d ",temp->info); temp=temp->next; void Menu() printf("\npress 1 - for Insert at start"); printf("\npress 2 - for Insert at End");

42 printf("\npress 3 - for Insert after"); printf("\npress 4 - for Delete from start"); printf("\npress 5 - for Delete from End"); printf("\npress 6 - for Delete after"); printf("\npress 7 - Delete entire list"); printf("\npress 8 - Display"); printf("\npress 0 - For Exit"); void main() Node *s; int choice; CreateEmptyList(&s); clrscr(); while(1) Menu(); printf("\n enter your choice : "); scanf("%d",&chocie); switch(choice) case 1:InsertatBegininning(&s);

43 break; case 2:InsertatEnd(&s); break; case 3:InsertAfter(&s); break; case 4:DeletefromStart(&s); break; case 5:DeletefromEnd(&s); break; case 6:DeleteAfter(&s); break; case 7:DeleteEntireList(&s); break; case 8:Display(&s); break; case 9:exit(0);

44 default:printf("\n enter only available choices");

45 10. Implementing Stack using linked lists. #include<stdio.h> #include<stdlib.h> Typedef struct nodetype int info; struct node *next; Node; Void CreateEmptyList(Node **s) *s=null; void Push(Node **s) int item; Node *temp,*current; printf( \n enter the item to insert : ); scanf( %d,&item); temp=(node*)malloc(sizeof(node)); temp->info=item; temp->next=null;

46 if(*s==null) *s=null; current=*s; while(current->next!=null) current=current->next; current->next=temp; void Pop(Node **s) Node *temp,*current; If(*s==NULL) Printf( \n list is empty ); if((*s)->next==null) temp=*s; *s=null; free(temp);

47 current=*s; temp=current->next; while(temp->next!=null) current=temp; temp=temp->next; current->next=null; free(temp); void Display(Node **s) Node *temp; printf("\n\n") if(*s==null) printf("list is empty"); temp=*s; while(temp!=null);

48 printf("%d ",temp->info); temp=temp->next; void Menu() printf("\npress 1 - for Push"); printf("\npress 2 - for Pop"); printf("\npress 3 - Display"); printf("\npress 4 - exit"); void main() Node *s; int choice; CreateEmptyList(&s); clrscr(); while(1) Menu();

49 printf("\n enter your choice : "); scanf("%d",&chocie); switch(choice) case 1:Push(&s); break; case 2:Pop(&s); break; case 3:Display(&s); break; case 4:exit(); default:printf("\n enter only available choices");

50 11. Implementing Queue using linked lists. #include<stdio.h> #include<stdlib.h> Typedef struct nodetype int info; struct node *next; Node; Void CreateEmptyQueue(Node **s) *s=null; Void Enqueue(Node **s) int item; Node *temp; printf( \n enter the item to insert : ); scanf( %d,&item); temp=(node*)malloc(sizeof(node)); temp->info=item; if(*s==null) temp->next=null;

51 *s=temp; temp->next=*s; void Dequeue(Node **s) Node *temp; If(*s==NULL) Printf( \n queue is empty ); temp=*s; *s=temp->next; free(temp); void Display(Node **s) Node *temp; printf("\n\n") if(*s==null) printf("queue is empty");

52 temp=*s; while(temp!=null); printf("%d ",temp->info); temp=temp->next; void Menu() printf("\npress 1 - Enqueue"); printf("\npress 2 - Dequeue"); printf("\npress 3 - Dispaly"); printf("\npress 4 - exit"); void main() Node *s; int choice; CreateEmptyQueue(&s); clrscr(); while(1)

53 Menu(); printf("\n enter your choice : "); scanf("%d",&chocie); switch(choice) case 1:Enqueue(&s); break; case 2:Dequeue(&s); break; case 3:Display(&s); break; case 4:exit(0); default:printf("\n enter only available choices");

54 12. Self-referential structures &doubly linked list operations #include<stdio.h> #include<stdlib.h> Typedef struct nodetype int info; struct node *next; struct node *prev; Node; Void CreateEmptyList(Node **s) *s=null; Void InsertatBegininning(Node **s) int item; Node *temp; printf( \n enter the item to insert : ); scanf( %d,&item); temp=(node*)malloc(sizeof(node));

55 temp->info=item; if(*s==null) temp->next=temp->prev=null; temp->next=*s; temp->prev=null; (*s)->prev=temp; *s=temp; void InsertatEnd(Node **s) int item; Node *temp,*current; printf( \n enter the item to insert : ); scanf( %d,&item); temp=(node*)malloc(sizeof(node)); temp->info=item; temp->next=null; if(*s==null) temp->prev=null

56 current=*s; while(current->next!=null) current=current->next; current->next=temp; temp->prev=current; void InsertAfter(Node **s) int item,after; Node *temp,*current; printf( \n enter the item to insert : ); scanf( %d,&item); printf( \n enter the after element : ); scanf( %d,&after); if(*s==null) printf("\n list is empty\n operation not possible"); current=*s;

57 while(current->info!=after && current!=null) current=current->next; if(current==null) printf( \n operation not possible ); temp=(node*)malloc(sizeof(node)); temp->info=item; if(current->next==null) temp->next=null; current->next=temp; temp->prev=current; temp->next=current->next; temp->prev=current; (current->next)->prev=temp; current->next=temp;

58 void InsertBefore(Node **s) int item,after; Node *temp,*current; printf( \n enter the item to insert : ); scanf( %d,&item); printf( \n enter the after element : ); scanf( %d,&after); if(*s==null) printf("\n list is empty\n operation not possible"); current=*s; while(current->info!=after && current!=null) current=current->next; if(current==null) printf( \n operation not possible ); temp=(node*)malloc(sizeof(node)); temp->info=item; if(current->prev==null)

59 temp->prev=null; temp->next=current; current->prev=temp; *s=temp; temp->next=current; temp->prev=current-prev; (current->prev)->next=temp; current->prev=temp; void DeletefromStart(Node **s) Node *temp; If(*s==NULL) Printf( \n list is empty ); if((*s)->next==nul)

60 temp=*s; *s=null; temp=*s; *s=temp->next; (*s)->prev=null; free(temp); void DeletefromEnd(Node **s) Node *temp; if(*s==null) Printf( \n list is empty ); if((*s)->next==nul) temp=*s; *s=null;

61 temp=*s; while(temp->next!=null) temp=temp->next; (current->prev)->next=null; free(temp); void DeleteAfter(Node **s) int after; Node *temp,*loc; if(*s==null) Printf( \n list is empty ); printf( \n enter the after element : ); scanf("%d",&after); loc=*s; while(loc->info!=after && loc!=null) loc=loc->next; if(loc==null)

62 printf("\n after element not present"); if((loc->next)->next==null) temp=loc->next; loc->next=null; free(temp) ; temp=loc->next; loc->next=temp->next; (temp->next)->prev=loc; free(temp); void DeleteBefore(Node **s) int before; Node *temp,*loc; if(*s==null) Printf( \n list is empty );

63 printf( \n enter the after element : ); scanf("%d",&before); loc=*s; while(loc->info!=before && loc!=null) loc=loc->next; if(loc==null) printf("\n after element not present"); if((loc->prev)->prev==null) temp=loc->prev; loc->prev=null; *s=loc; free(temp) ; temp=loc->prev; loc->prev=temp->prev; (temp->prev)->next=loc; free(temp);

64 void DeleteEntireList(Node **s) Node *temp; while(*s!=null) temp=*s; *s=(*s)->next; free(temp); void Display(Node **s) Node *temp; printf("\n\n") if(*s==null) printf("list is empty"); temp=*s; while(temp!=null);

65 printf("%d ",temp->info); temp=temp->next; void Menu() printf("\npress 1 - for Insert at start"); printf("\npress 2 - for Insert at End"); printf("\npress 3 - for Insert after"); printf("\npress 4 - for Insert Before"); printf("\npress 5 - for Delete from start"); printf("\npress 6 - for Delete from End"); printf("\npress 7 - for Delete after"); printf("\npress 8 - for Delete before"); printf("\npress 9 - Delete entire list"); printf("\npress 10 - Display"); printf("\npress 0 - For Exit"); void main()

66 Node *s; int choice; CreateEmptyList(&s); clrscr(); while(1) Menu(); printf("\n enter your choice : "); scanf("%d",&chocie); switch(choice) case 1:InsertatBegininning(&s); break; case 2:InsertatEnd(&s); break; case 3:InsertAfter(&s); break; case 4:InsertBefore(&s); break;

67 case 5:DeletefromStart(&s); break; case 6:DeletefromEnd(&s); break; case 7:DeleteAfter(&s); break; case 8:DeleteBefore(&s); break; case 9:DeleteEntireList(&s); break; case 10:Display(&s); break; case 0:exit(0); default:printf("\n enter only available choices");

68 13. LinearSearch. #include <stdio.h> int main() int array[100], search, c, n; printf("enter the number of elements in array\n"); scanf("%d",&n); printf("enter %d integer(s)\n", n); for (c = 0; c < n; c++) scanf("%d", &array[c]); printf("enter the number to search\n"); scanf("%d", &search); for (c = 0; c < n; c++) if (array[c] == search) /* if required element found */ printf("%d is present at location %d.\n", search, c+1); break;

69 if (c == n) printf("%d is not present in array.\n", search); return 0;

70 14. Binary Search. #include <stdio.h> int main() int c, first, last, middle, n, search, array[100]; printf("enter number of elements\n"); scanf("%d",&n); printf("enter %d integers\n", 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)

71 first = middle + 1; if (array[middle] == search) printf("%d found at location %d.\n", search, middle+1); break; last = middle - 1; middle = (first + last)/2; if (first > last) printf("not found! %d is not present in the list.\n", search); return 0;

72 15. Selection Sort. #include <stdio.h> int main() int data[100],i,n,steps,temp; printf("enter the number of elements to be sorted: "); scanf("%d",&n); for(i=0;i<n;++i) printf("%d. Enter element: ",i+1); scanf("%d",&data[i]); for(steps=0;steps<n;++steps) for(i=steps+1;i<n;++i) if(data[steps]>data[i]) /* To sort in descending order, change > to <. */ temp=data[steps]; data[steps]=data[i]; data[i]=temp; printf("in ascending order: ");

73 for(i=0;i<n;++i) printf("%d ",data[i]); return 0; Output Enter the number of elements to be sorted: 5 1. Enter element: Enter element: 1 3. Enter element: Enter element: 2 5. Enter element: 0 In ascending order:

74 16. Bubble Sort. #include <stdio.h> int main() int data[100],i,n,step,temp; printf("enter the number of elements to be sorted: "); scanf("%d",&n); for(i=0;i<n;++i) printf("%d. Enter element: ",i+1); scanf("%d",&data[i]); for(step=0;step<n-1;++step) for(i=0;i<n-step-1;++i) if(data[i]>data[i+1]) /* To sort in descending order, change > to < in this line. */ temp=data[i]; data[i]=data[i+1]; data[i+1]=temp; printf("in ascending order: ");

75 for(i=0;i<n;++i) printf("%d ",data[i]); return 0; Enter the number of elements to be sorted: 6 1. Enter element: Enter element: 3 3. Enter element: 0 4. Enter element: Enter element: 1 6. Enter element: -9 In ascending order: Insertion sort.

76 #include<stdio.h> int main() int data[100],n,temp,i,j; printf("enter number of terms(should be less than 100): "); scanf("%d",&n); printf("enter elements: "); for(i=0;i<n;i++) scanf("%d",&data[i]); for(i=1;i<n;i++) temp = data[i]; j=i-1; while(temp<data[j] && j>=0) /*To sort elements in descending order, change temp<data[j] to temp>data[j] in above line.*/ data[j+1] = data[j]; --j; data[j+1]=temp;

77 printf("in ascending order: "); for(i=0; i<n; i++) printf("%d\t",data[i]); return 0; Enter number of terms(should be less than 100): 5 Enter elements: In ascending order: Merge sort.

78 #include <stdio.h> void mergesort(int [], int, int, int); void partition(int [],int, int); int main() int list[50]; int i, size; printf("enter total number of elements:"); scanf("%d", &size); printf("enter the elements:\n"); for(i = 0; i < size; i++) scanf("%d", &list[i]); partition(list, 0, size - 1); printf("after merge sort:\n"); for(i = 0;i < size; i++) printf("%d ",list[i]);

79 return 0; void partition(int list[],int low,int high) int mid; if(low < high) mid = (low + high) / 2; partition(list, low, mid); partition(list, mid + 1, high); mergesort(list, low, mid, high); void mergesort(int list[],int low,int mid,int high) int i, mi, k, lo, temp[50]; lo = low; i = low; mi = mid + 1;

80 while ((lo <= mid) && (mi <= high)) if (list[lo] <= list[mi]) temp[i] = list[lo]; lo++; temp[i] = list[mi]; mi++; i++; if (lo > mid) for (k = mi; k <= high; k++) temp[i] = list[k]; i++;

81 for (k = lo; k <= mid; k++) temp[i] = list[k]; i++; for (k = low; k <= high; k++) list[k] = temp[k]; 19. Quick sort.

82 #include <stdio.h> void quicksort (int [], int, int); int main() int list[50]; int size, i; printf("enter the number of elements: "); scanf("%d", &size); printf("enter the elements to be sorted:\n"); for (i = 0; i < size; i++) scanf("%d", &list[i]); quicksort(list, 0, size - 1); printf("after applying quick sort\n"); for (i = 0; i < size; i++) printf("%d ", list[i]); printf("\n");

83 return 0; void quicksort(int list[], int low, int high) int pivot, i, j, temp; if (low < high) pivot = low; i = low; j = high; while (i < j) while (list[i] <= list[pivot] && i <= high) i++; while (list[j] > list[pivot] && j >= low) j--; if (i < j) temp = list[i]; list[i] = list[j];

84 list[j] = temp; temp = list[j]; list[j] = list[pivot]; list[pivot] = temp; quicksort(list, low, j - 1); quicksort(list, j + 1, high); 20. Radix (bucket) sort method.

85 #include <stdio.h> int min = 0, count = 0, array[100] = 0, array1[100] = 0; void main() int k, i, j, temp, t, n; printf("enter size of array :"); scanf("%d", &count); printf("enter elements into array :"); for (i = 0; i < count; i++) scanf("%d", &array[i]); array1[i] = array[i]; for (k = 0; k < 3; k++) for (i = 0; i < count; i++) min = array[i] % 10; /* To find minimum LSD */ t = i; for (j = i + 1; j < count;j++) if (min > (array[j] % 10))

86 min = array[j] % 10; t = j; temp = array1[t]; array1[t] = array1[i]; array1[i] = temp; temp = array[t]; array[t] = array[i]; array[i] = temp; for (j = 0; j < count; j++) /*to find MSD */ array[j] = array[j] / 10; printf("sorted Array (Using LSD Radix sort) : "); for (i = 0; i < count; i++) printf("%d ", array1[i]); 21. Binary Search Tree operations.

87 #include <stdio.h> #include <conio.h> typedef struct node int info; struct node *left; struct node *right; BST; void CreateEmptyTree(BST **tree) *tree=null; void PreOrderTraversal(BST *tree) if(tree==null) printf("%d",tree->info); PreOrderTraversal(tree->left); PreOrderTraversal(tree->right);

88 void InOrderTraversal(BST *tree) if(tree==null) InOrderTraversal(tree->left); printf("%d",tree->info); InOrderTraversal(tree->right); void PostOrderTraversal(BST *tree) if(tree==null) PostOrderTraversal(tree->left); PostOrderTraversal(tree->right); printf("%d",tree->info); int DetermineHeight(BST *tree)

89 int leftheight,rightheight; if(tree==null) return(0); leftheight=determineheight(tree->left); rightheight=leftheight=determineheight(tree->right); if(leftheight>rightheight) return(++leftheight); return(++rightheight); int NodesCount(BST *tree) if(tree==null) return(0); return(nodescount(tree->left) + NodesCount(tree-right) + 1); int InternalNodes(BST * tree)

90 if((tree==null) ((tree->left==null) && (tree->right==null))) return(0); return(internalnodes(tree->left)+internalnodes(tree->right)+1) int ExternalNodes(BST * tree) if((tree==null) ((tree->left==null) && (tree->right==null))) return(0); if((tree->left==null) && (tree->right==null)) return(1); return(externalnodes(tree->left)+externalnodes(tree->right)) void RemoveTree(BST **tree) if(*tree!=null) RemoveTree(&(*tree)->left); RemoveTree(&(*tree)->right); free(*tree);

91 void Insert(BST **tree) int item; BST *temp,*current,*parent; printf("\n enter the element : "); scanf("%d",&item); temp=(bst*)malloc(sizeof(bst)); temp->info=item; temp->left=temp->right=null; if(tree==null) *tree=temp; parent=null; current=*tree; while(current!=null) parent=current; if(item<current->info) current=current->left; current=current->right;

92 if(item<parent->info) parent->left=temp; parent->right=temp; BST *LargetNode(BST *tree) if((tre==null) (tree->right==null)) return(tree) return(largestnode(tree->right)); BST *SmallestNode(BST *tree) if((tre==null) (tree->left==null)) return(tree) return(smallestnode(tree->left)); void DeleteNode(BST **tree,int element)

93 int item; BST *temp; if(*tree==null) printf("\n tree is empty"); if(element<(*tree)->info) Delete(&((*tree)->left)); if(element>(*tree)->info) Delete(&((*tree)->right); if((*tree)->info) && (*tree)->right) temp=largestnode((*tree)->left); (*tree->info)=temp->info; Delete(&((*tree)->left),temp->info); temp=*tree; if(((*tree)->left==null)&&(*tree)->right==null) *tree=null; if((*tree)->left!=null) *tree=(*tree)->left; *tree=(*tree)->right; free(temp);

94 Delete(&((*tree)->left)); void Menu() printf("\n press 1 for Insert"); printf("\n press 2 for Delete"); printf("\n press 3 for In-Order Traversal"); printf("\n press 4 for Pre-Order Traversal"); printf("\n press 5 for Post-Order Traversal"); printf("\n press 6 for Total Nodes"); printf("\n press 7 for Total External nodes"); printf("\n press 8 for Total Internal Nodes"); printf("\n press 9 for Height"); printf("\n press 10 for Smallest Node"); printf("\n press 11 for Largest"); printf("\n press 0 for Exit"); void main() int choice,element; BST *tree;

95 CreateEmptyTree(&tree); while(1) Menu(); printf("\n enter your choice : "); scanf("%d",&choice); switch(choice) case 1:Insert(&tree); break; case 2:printf("\n enter the element to delete : "); scanf("%d",&element); DeleteNode(&tree,element); break; case 3:void InOrderTraversal(tree); break; case 4:void PreOrderTraversal(tree); break; case 5:void PostOrderTraversal(tree); break; case 6:NodesCount(tree); break;

96 case 7:ExternalNodes(tree); break; case 8:InternalNodes(tree); break; case 9: DetermineHeight(tree); break; case 10:SmallestNode(tree); break; case 11:LargetNode(tree); break; case 0:exit(); default: printf("\n please enter available choices only"); 22. Heap sort & AVL tree implementations.

97 #include <stdio.h> void main() int heap[10], no, i, j, c, root, temp; printf("\n Enter no of elements :"); scanf("%d", &no); printf("\n Enter the nos : "); for (i = 0; i < no; i++) scanf("%d", &heap[i]); for (i = 1; i < no; i++) c = i; do root = (c - 1) / 2; if (heap[root] < heap[c]) /* to create MAX heap array */ temp = heap[root]; heap[root] = heap[c]; heap[c] = temp; c = root;

98 while (c!= 0); printf("heap array : "); for (i = 0; i < no; i++) printf("%d\t ", heap[i]); for (j = no - 1; j >= 0; j--) temp = heap[0]; heap[0] = heap[j /* swap max element with rightmost leaf element */ heap[j] = temp; root = 0; do c = 2 * root + 1; /* left node of root element */ if ((heap[c] < heap[c + 1]) && c < j-1) c++; if (heap[root]<heap[c] && c<j) /* again rearrange to max heap array */ temp = heap[root]; heap[root] = heap[c]; heap[c] = temp; root = c;

99 while (c < j); printf("\n The sorted array is : "); for (i = 0; i < no; i++) printf("\t %d", heap[i]); printf("\n Complexity : \n Best case = Avg case = Worst case = O(n logn) \n"); 23. Write a program in C for DFS

100 #include <stdio.h> #include <stdlib.h> struct node int vertex; struct node* next; ; struct node* createnode(int v); struct Graph int numvertices; int* visited; struct node** adjlists; // we need int** to store a two dimensional array. Similary, we need struct node** to store an array of Linked lists ; struct Graph* creategraph(int); void addedge(struct Graph*, int, int); void printgraph(struct Graph*); void DFS(struct Graph*, int);

101 int main() struct Graph* graph = creategraph(4); addedge(graph, 0, 1); addedge(graph, 0, 2); addedge(graph, 1, 2); addedge(graph, 2, 3); printgraph(graph); DFS(graph, 2); return 0; void DFS(struct Graph* graph, int vertex) struct node* adjlist = graph->adjlists[vertex]; struct node* temp = adjlist; graph->visited[vertex] = 1; printf("visited %d \n", vertex); while(temp!=null)

102 int connectedvertex = temp->vertex; if(graph->visited[connectedvertex] == 0) DFS(graph, connectedvertex); temp = temp->next; struct node* createnode(int v) struct node* newnode = malloc(sizeof(struct node)); newnode->vertex = v; newnode->next = NULL; return newnode; struct Graph* creategraph(int vertices) struct Graph* graph = malloc(sizeof(struct Graph)); graph->numvertices = vertices; graph->adjlists = malloc(vertices * sizeof(struct node*));

103 graph->visited = malloc(vertices * sizeof(int)); int i; for (i = 0; i < vertices; i++) graph->adjlists[i] = NULL; graph->visited[i] = 0; return graph; void addedge(struct Graph* graph, int src, int dest) // Add edge from src to dest struct node* newnode = createnode(dest); newnode->next = graph->adjlists[src]; graph->adjlists[src] = newnode; // Add edge from dest to src newnode = createnode(src); newnode->next = graph->adjlists[dest]; graph->adjlists[dest] = newnode;

104 void printgraph(struct Graph* graph) int v; for (v = 0; v < graph->numvertices; v++) struct node* temp = graph->adjlists[v]; printf("\n Adjacency list of vertex %d\n ", v); while (temp) printf("%d -> ", temp->vertex); temp = temp->next; printf("\n");