Binary Search

Binary Search is one of the Divide and Conquer Algorithms which check the availability of an element in the list. The algorithm applies to sorted lists only. Here is the code:

int binarysearch(int array[], int key, int size) {
        bool found;
 int flag = 0;
 int low = 0;
 int high = size;
 int mid = (high + low) / 2;
 while (high > low){
  if (key == array[mid]) {
   flag = flag + 1;
    break;
  }
   if (key < array[mid]) high = mid - 1;
   if (key > array[mid]) low = mid + 1;
  mid = (low + high) / 2;
 }
 if(flag==1) found=true;
        else found=false;
        return found;
}