INTRSRCH - } void main() { int n,i,k,arr[max]; clrscr();...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
#include<stdio.h> #include<conio.h> # /* RISHI AGARWAL BINARY SEARCH ROLL NO 02 SE CMPN A */ * #define max 20 # void display(int a[],int n) { int i; printf("\nLIST\n"); for(i=0;i<n;i++) printf("%d ",a[i]); } void isort(int arr[],int n) { int i,j,x; for(i=1;i<=n-1;i++) { x=arr[i]; j=i; { arr[j]=arr[j-1]; j--; } arr[j]=x; } } void binsrch(int a[],int key,int low,int high) { int mid; while(high>=low) { mid=low+(((high-low)*(key-a[low]))/(a[high]-a[low])); if(a[mid]==key) {printf("The element %d is found at position %d",a[mid],mid); return;} else if(a[mid]>key) high=mid-1; else low=mid+1; } printf("Element Not Found");
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: } void main() { int n,i,k,arr[max]; clrscr(); printf("Enter the no of data:"); scanf("%d",&n); printf("Enter the nos"); for(i=0;i<n;i++) scanf("%d",&arr[i]); //Displaying List display(arr,n); //Insertion Sort isort(arr,n); //Displaying Sorted List display(arr,n); printf("\nEnter the key:"); scanf("%d",&k); binsrch(arr,k,0,n-1); getch(); } /* OUTPUT: Enter the no of data:10 Enter the nos3 15 7 18 8 10 5 16 19 23 LIST 3 15 7 18 8 10 5 16 19 23 LIST 3 5 7 8 10 15 16 18 19 23 Enter the key:16 The element 16 is found at position 6 */...
View Full Document

This note was uploaded on 10/25/2010 for the course CMPN SEM4 taught by Professor Thakur during the Spring '07 term at University of Mumbai.

Page1 / 2

INTRSRCH - } void main() { int n,i,k,arr[max]; clrscr();...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online