Write a C Program to perform Binary Search.

 Write a C Program to perform Binary Search.

Input Format:

The first line consists of 2 integers N and M denoting the size of the array and the element to be searched for in the array, respectively. The next line contains N space-separated integers denoting the elements of the array.

Output Format

Print a single integer denoting the index of the first occurrence of integer M in the array if it exists, otherwise print -1.

codes

#include <stdio.h>

int main()

{

  int c, first, last, middle, n, search, array[100];

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

  scanf("%d", &n);

  printf("Enter %d integers\n", n);

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

    scanf("%d", &array[c]);

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

  scanf("%d", &search);

  first = 0;

  last = n - 1;

  middle = (first+last)/2;

  while (first <= last) {

    if (array[middle] < search)

      first = middle + 1;

    else if (array[middle] == search) {

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

      break;

    }

    else

      last = middle - 1;

    middle = (first + last)/2;

  }

  if (first > last)

    printf("Not found! %d isn't present in the list.\n", search);

  return 0;

}