import java.io.*;

public class BinSearch {

  public static int binarySearch(int data[], int x) {
    int index;
    int begin = 0;
    int end = data.length - 1;
    while(begin<= end) {
      index = (begin+end)/2;
      if(data[index] == x) {
        return index;
      } else if (data[index] < x) {
        begin = index+1;
      } else {
        end = index - 1;
      }
    }
    return -1;
  } 

  public static void main(String argv[]) {
    int a[] = {-1, 0, 2, 4, 5, 88, 56, 77, 88, 109};
    int i = BinSearch.binarySearch(a, 88);
    if(i != -1) {
      System.out.println("Item found at index: "+i);
    } else {
      System.out.println("Not found");
    }
  }
}