BINARY SEARCH

|| BINARY SEARCH ||

#2 WRITE A PROGRAM TO PERFORM BINARY SEARCH IN C.

Q. WHAT IS BINARY SEARCH?

ANS:A binary search, also known as a half-interval search, is an algorithm used in computer science to locate a specified value (key) within an array. For the search to be binary, the array must be sorted in either ascending or descending order.

                               EXAMPLE:

                 Binary search program in C

#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;
}

Output of program:

CLICK HERE!!!! TO WATCH FULL VIDEO OF BINARY SEARCH ON YOUTUBE.

THANKYOU:)

RAJ ARYAN