Binary Search

BinarySearch.java

int binarySearch(int[] a, int x) { 
  int low = 0;
  int high = a.length - 1; 
  int mid;
  while (low <= high) { 
    mid = (low + high) 
    if (a[mid] < x) {
      low = mid + 1; 
    } else if(a[mid]>x){
      high = mid - 1; 
    } else {
      return mid;
    }
  }
  return -1;
}