Binary Search in C Programming

In this source code example, we will write a code to implement the Binary Search algorithm in the C programming language.

In this C program, we will take input from the User or console.  

Binary Search in C Programming

#include<stdio.h>
int Binarysearch(int[], int, int);
void main() {
	int x[20], i, n, p, key;
	printf("\n Enter the no of element:");
	scanf("%d", &n);
	printf("\n Enter %d elements in ascending order:", n);
	for (i = 0; i < n; i++)
		scanf("%d", &x[i]);
	printf("\n Enter the element to be search:");
	scanf("%d", &key);
	p = Binarysearch(x, n, key);
	if (p == -1)
		printf("\n The search is unsuccessful:\n");
	else
		printf("\n%d is found at location %d", key, p);
}
int Binarysearch(int a[], int n, int k) {
	int lo, hi, mid;
	lo = 0;
	hi = n - 1;
	while (lo <= hi) {
		mid = (lo + hi) / 2;
		if (k == a[mid])
			return (mid);
		if (k < a[mid])
			hi = mid - 1;
		else
			lo = mid + 1;
	}
	return (-1);
}

Output:


 Enter the no of element:
7

 Enter 7 elements in ascending order:
10
20
30
40
50
60
70

 Enter the element to be search:
60

60 is found at location 5

Related Algorithms in C Programming


Comments