Binary Search C Program in Data Structures

Data Structures Lab Manual / Binary Search C Program in Data Structures

Program Name: Write a C Program for Binary Seach in Data Structures

Theory

Binary Search first Sort the elements of the array in Ascending order and try to search the key element based
on the mid value = (beg+end)/2;

Program Code

#include<stdio.h> 
#include<conio.h> 
void main()
{
int a[20],ne,mid,beg=0,i,end,searchelement,loc=-1; 

printf("Enter Number of Elements: "); 
scanf("%d",&ne);

printf("Enter Elements in Ascending Order: "); 
for(i=0;i<ne;i++)
scanf("%d",&a[i]);

    
printf("Enter Search Element: "); 
scanf("%d",&searchelement);
end=ne-1;

while(beg<=end)
{
mid=(beg+end)/2; 
if(searchelement==a[mid])
{
loc=mid; 
break;
}
else if(a[mid]<searchelement) 
beg=mid+1;
else end=mid-1;
}

if(loc==-1)
printf("Element Not Present"); 
else
printf("Element found at =%d",loc+1); 
getch();
}

Input:
Enter Number of Elements: 5
Enter Elements in Ascending Order: 1 3 5 7 9
Enter Search Element: 5

Output:
Element found at =3

Home Back