In this article we will learn to implement a C program to search an element using binary search. A C program is provided below which illustrates using binary search for searching a given element.
Program is as follows:
//C program to search for an element using binary search
#include<stdio.h>
#include<conio.h>
void main()
{
int a[6],key,low,high,mid,i;
bool flag;
printf("Enter 6 numbers: ");
for(i=0;i<6;i++)
scanf("%d",&a[i]);
printf("Enter the number to search: ");
scanf("%d",&key);
low=0;
high=6;
flag=false;
while(low<=high)
{
mid=(low+high)/2;
if(key==a[mid])
{
flag=true;
break;
}
if(key<a[mid])
high=mid-1;
if(key>a[mid])
low=mid+1;
}
if(flag==true)
printf("%d is found",key);
else
printf("%d is not found",key);
getch();
}
Input and output for the above program is as follows:
Enter 6 numbers: 1 2 3 4 5 6
Enter the number to search: 6
6 is found
Suryateja Pericherla, at present is a Research Scholar (full-time Ph.D.) in the Dept. of Computer Science & Systems Engineering at Andhra University, Visakhapatnam. Previously worked as an Associate Professor in the Dept. of CSE at Vishnu Institute of Technology, India.
He has 11+ years of teaching experience and is an individual researcher whose research interests are Cloud Computing, Internet of Things, Computer Security, Network Security and Blockchain.
He is a member of professional societies like IEEE, ACM, CSI and ISCA. He published several research papers which are indexed by SCIE, WoS, Scopus, Springer and others.
Leave a Reply