34
1.Program for search an element by using linear search algorithm. #include <stdio.h> #include<conio.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; } }

ADA FILE

Embed Size (px)

Citation preview

Page 1: ADA FILE

1.Program for search an element by using linear search algorithm.

#include <stdio.h>

#include<conio.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;

}

}

if (c == n)

printf("%d is not present in array.\n", search);

Page 2: ADA FILE

getch();

}

OUTPUT-

Page 3: ADA FILE

2.Program for search an element by using binary search algorithm.

#include <stdio.h>

#include<conio.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)

first = middle + 1;

else if (array[middle] == search) {

printf("%d found at location %d.\n", search, middle+1);

break;

}

Page 4: ADA FILE

else

last = middle - 1;

middle = (first + last)/2;

}

if (first > last)

printf("Not found! %d is not present in the list.\n", search);

getch();

}

OUTPUT-

Page 5: ADA FILE

3.Program of sorting elements by using merge sort algorithm.

#include <stdio.h>

#include <conio.h>

int main( )

{

int a[5] = { 11, 2, 9, 13, 57 } ;

int b[5] = { 25, 17, 1, 90, 3 } ;

int c[10] ;

int i, j, k, temp ;

printf ( "Merge sort.\n" ) ;

printf ( "\nFirst array:\n" ) ;

for ( i = 0 ; i <= 4 ; i++ )

printf ( "%d\t", a[i] ) ;

printf ( "\n\nSecond array:\n" ) ;

for ( i = 0 ; i <= 4 ; i++ )

printf ( "%d\t", b[i] ) ;

for ( i = 0 ; i <= 3 ; i++ )

{

for ( j = i + 1 ; j <= 4 ; j++ )

{

if ( a[i] > a[j] )

{

temp = a[i] ;

a[i] = a[j] ;

Page 6: ADA FILE

a[j] = temp ;

}

if ( b[i] > b[j] )

{

temp = b[i] ;

b[i] = b[j] ;

b[j] = temp ;

}

}

}

for ( i = j = k = 0 ; i <= 9 ; )

{

if ( a[j] <= b[k] )

c[i++] = a[j++] ;

else

c[i++] = b[k++] ;

if ( j == 5 || k == 5 )

break ;

}

for ( ; j <= 4 ; )

c[i++] = a[j++] ;

for ( ; k <= 4 ; )

c[i++] = b[k++] ;

printf ( "\n\nArray after sorting:\n") ;

Page 7: ADA FILE

for ( i = 0 ; i <= 9 ; i++ )

printf ( "%d\t", c[i] ) ;

getch( ) ;

}

OUTPUT-

Page 8: ADA FILE

4.Program of sorting elements by using quick sort algorithm.

#include<stdio.h>

#include<conio.h>

void quicksort(int [10],int,int);

int main(){

int x[20],size,i;

printf("Enter size of the array: ");

scanf("%d",&size);

printf("Enter %d elements: ",size);

for(i=0;i<size;i++)

scanf("%d",&x[i]);

quicksort(x,0,size-1);

printf("Sorted elements: ");

for(i=0;i<size;i++)

printf(" %d",x[i]);

return 0;

}

void quicksort(int x[10],int first,int last){

int pivot,j,temp,i;

if(first<last){

pivot=first;

i=first;

j=last;

while(i<j){

Page 9: ADA FILE

while(x[i]<=x[pivot]&&i<last)

i++;

while(x[j]>x[pivot])

j--;

if(i<j){

temp=x[i];

x[i]=x[j];

x[j]=temp;

}

}

temp=x[pivot];

x[pivot]=x[j];

x[j]=temp;

quicksort(x,first,j-1);

quicksort(x,j+1,last);

}

getch();

}

Page 10: ADA FILE

OUTPUT-

Page 11: ADA FILE

5.Program of sorting elements by using selection sort algorithm.

#include <stdio.h>

#include<conio.h>

int main()

{

int array[100], n, c, d, position, swap;

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]);

for ( c = 0 ; c < ( n - 1 ) ; c++ )

{

position = c;

for ( d = c + 1 ; d < n ; d++ )

{

if ( array[position] > array[d] )

position = d;

}

if ( position != c )

{

swap = array[c];

array[c] = array[position];

Page 12: ADA FILE

array[position] = swap;

}

}

printf("Sorted list in ascending order:\n");

for ( c = 0 ; c < n ; c++ )

printf("%d\n", array[c]);

getch();

}

OUTPUT-

Page 13: ADA FILE

6.Program of sorting elements by using bubble sort algorithm.

#include<stdio.h>

#include<conio.h>

int main()

{

int s,temp,i,j,a[20];

printf("Enter total numbers of elements: ");

scanf("%d",&s);

printf("Enter %d elements: ",s);

for(i=0;i<s;i++)

scanf("%d",&a[i]);

//Bubble sorting algorithm

for(i=s-2;i>=0;i--){

for(j=0;j<=i;j++){

if(a[j]>a[j+1]){

temp=a[j];

a[j]=a[j+1];

a[j+1]=temp;

}

}

}

printf("After sorting: ");

for(i=0;i<s;i++)

printf(" %d",a[i]);

Page 14: ADA FILE

getch();

}

OUTPUT-

Page 15: ADA FILE

7.Stack implementation using array.

#include<stdio.h>

#include<conio.h>

#include<stdlib.h>

#define size 5

struct stack {

int s[size];

int top;

} st;

int stfull() {

if (st.top >= size - 1)

return 1;

else

return 0;

}

void push(int item) {

st.top++;

st.s[st.top] = item;

}

int stempty() {

if (st.top == -1)

return 1;

else

return 0;

Page 16: ADA FILE

}

int pop() {

int item;

item = st.s[st.top];

st.top--;

return (item);

}

void display() {

int i;

if (stempty())

printf("\nStack Is Empty!");

else {

for (i = st.top; i >= 0; i--)

printf("\n%d", st.s[i]);

}

}

int main() {

int item, choice;

char ans;

st.top = -1;

printf("\n\tImplementation Of Stack");

do {

printf("\nMain Menu");

printf("\n1.Push \n2.Pop \n3.Display \n4.exit");

Page 17: ADA FILE

printf("\nEnter Your Choice");

scanf("%d", &choice);

switch (choice) {

case 1:

printf("\nEnter The item to be pushed");

scanf("%d", &item);

if (stfull())

printf("\nStack is Full!");

else

push(item);

break;

case 2:

if (stempty())

printf("\nEmpty stack!Underflow !!");

else {

item = pop();

printf("\nThe popped element is %d", item);

}

break;

case 3:

display();

break;

case 4:

exit(0);

Page 18: ADA FILE

}

printf("\nDo You want To Continue?");

ans = getche();

} while (ans == 'Y' || ans == 'y');

getch();

}

OUTPUT-

Page 19: ADA FILE

8.Program to display Fibonacci series using recursion.

#include<stdio.h>

#include<conio.h>

void printFibonacci(int);

int main(){

int k,n;

long int i=0,j=1,f;

printf("Enter the range of the Fibonacci series: ");

scanf("%d",&n);

printf("Fibonacci Series: ");

printf("%d %d ",0,1);

printFibonacci(n);

return 0;

}

void printFibonacci(int n){

static long int first=0,second=1,sum;

if(n>0){

sum = first + second;

first = second;

second = sum;

printf("%ld ",sum);

printFibonacci(n-1);

}

getch();

Page 20: ADA FILE

}

OUTPUT-

Page 21: ADA FILE

9.Queue implementation using array.

#include<stdio.h>

#include<conio.h>

#define MAX 10

void insert(int);

int del();

int queue[MAX], rear=0, front=0;

void display();

int main()

{

char ch , a='y';

int choice, token;

printf("1.Insert");

printf("\n2.Delete");

printf("\n3.show or display");

do

{

printf("\nEnter your choice for the operation: ");

scanf("%d",&choice);

switch(choice)

{

case 1: insert(token);

display();

break;

Page 22: ADA FILE

token=del();

printf("\nThe token deleted is %d",token);

display();

break;

case 3:

display();

break;

default:

printf("Wrong choice");

break;

}

printf("\nDo you want to continue(y/n):");

ch=getch();

}

while(ch=='y'||ch=='Y');

getch();

}

void display()

{

int i;

printf("\nThe queue elements are:");

for(i=rear;i<front;i++)

{

printf("%d ",queue[i]);

Page 23: ADA FILE

}

}

void insert(int token)

{

char a;

if(rear==MAX)

{

printf("\nQueue full");

return;

}

do

{

printf("\nEnter the token to be inserted:");

scanf("%d",&token);

queue[front]=token;

front=front+1;

printf("do you want to continue insertion Y/N");

a=getch();

}

while(a=='y');

}

int del()

{

int t;

Page 24: ADA FILE

if(front==rear)

{

printf("\nQueue empty");

return 0;

}

rear=rear+1;

t=queue[rear-1];

return t;

}

OUTPUT-

Page 25: ADA FILE

10.Program for insertion, deletion, display and traversal in binary search tree.

#include<iostream>

#include<conio.h>

#include<stdlib.h>

using namespace std;

void insert(int,int );

void delte(int);

void display(int);

int search(int);

int search1(int,int);

int tree[40],t=1,s,x,i;

main()

{

int ch,y;

for(i=1;i<40;i++)

tree[i]=-1;

while(1)

{

cout <<"1.INSERT\n2.DELETE\n3.DISPLAY\n4.SEARCH\n5.EXIT\nEnter your choice:";

cin >> ch;

switch(ch)

{

case 1:

Page 26: ADA FILE

cout <<"enter the element to insert";

cin >> ch;

insert(1,ch);

break;

case 2:

cout <<"enter the element to delete";

cin >>x;

y=search(1);

if(y!=-1) delte(y);

else cout<<"no such element in tree";

break;

case 3:

display(1);

cout<<"\n";

for(int i=0;i<=32;i++)

cout <<i;

cout <<"\n";

break;

case 4:

cout <<"enter the element to search:";

cin >> x;

y=search(1);

if(y == -1) cout <<"no such element in tree";

else cout <<x << "is in" <<y <<"position";

Page 27: ADA FILE

break;

case 5:

exit(0);

}

}

}

void insert(int s,int ch )

{

int x;

if(t==1)

{

tree[t++]=ch;

return;

}

x=search1(s,ch);

if(tree[x]>ch)

tree[2*x]=ch;

else

tree[2*x+1]=ch;

t++;

}

void delte(int x)

{

Page 28: ADA FILE

if( tree[2*x]==-1 && tree[2*x+1]==-1)

tree[x]=-1;

else if(tree[2*x]==-1)

{ tree[x]=tree[2*x+1];

tree[2*x+1]=-1;

}

else if(tree[2*x+1]==-1)

{ tree[x]=tree[2*x];

tree[2*x]=-1;

}

else

{

tree[x]=tree[2*x];

delte(2*x);

}

t--;

}

int search(int s)

{

if(t==1)

{

cout <<"no element in tree";

return -1;

}

Page 29: ADA FILE

if(tree[s]==-1)

return tree[s];

if(tree[s]>x)

search(2*s);

else if(tree[s]<x)

search(2*s+1);

else

return s;

}

void display(int s)

{

if(t==1)

{cout <<"no element in tree:";

return;}

for(int i=1;i<40;i++)

if(tree[i]==-1)

cout <<" ";

else cout <<tree[i];

return ;

}

int search1(int s,int ch)

{

if(t==1)

{

Page 30: ADA FILE

cout <<"no element in tree";

return -1;

}

if(tree[s]==-1)

return s/2;

if(tree[s] > ch)

search1(2*s,ch);

else search1(2*s+1,ch);

}

OUTPUT-