/* Program that implements binary search
 * Carsten Butz, September 2002
 */

class BinSearch{

  public static void main(String[] args){

    // fill in some code to test the method below!

  }

  static boolean binsearch(int[] arr, int key){
    boolean found = false;
    int l = 0;              // left marker
    int r = arr.length - 1; // right marker
    int c;                  // centre point

    while(l<=r && !found){
      c = (l+r)/2;

      if(a[c]==key)
	found = true;
      else if(a[c]<key)
	{// search in upper part
	  l = c + 1;
	}
      else
	{// search in lower part
	  r = c - 1;
	}
    }
    return found;
  }

}