DS || Section B || Pgm 4 || Program to search an element using binary search technique.

 #include <stdio.h>

void main()

{

int i, beg, end, mid, n, key, a[100];

printf("Enter number of elements\n");

scanf("%d", &n);

printf("Enter elements of array\n");

for (i = 0; i < n; i++)

scanf("%d", &a[i]);

printf("Enter value to find\n");

scanf("%d", &key);

beg = 0;

end = n - 1;

mid = (beg+end)/2;

while (beg <= end)

{

if (a[mid] == key)

{

printf("%d found at location %d.\n", key, mid+1);

break;

}

else if (a[mid] < key)

beg = mid + 1;

else

end = mid - 1;

mid = (beg+end)/2;

}

if (beg > end)

printf("%d is not present in the array.\n", key);

}