1

2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

//Program to search an element using binary search

#include<stdio.h>
int key,a[1000];
int binsearch(int start,int end)
{
int mid=start+(end-start)/2;
if(start>end)
return -1;
if(a[mid]==key)
return mid;
else if(a[mid]>key)
return binsearch(start,mid-1);
else
return binsearch(mid+1,end);
}
int main()
{
int i,n,ans;
printf("Enter number of elements ");
scanf("%d",&n);
printf("Enter the elements\n");
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
printf("Enter element to be searched ");
scanf("%d",&key);
ans=binsearch(0,n-1);
if(ans==-1)
printf("Element not found\n");
else
printf("Element found at %d\n",ans+1);
return 0;
}

OUTPUT: