csTechie

  public static int binarySearch(int a[],int s)
  {
     int N = a.length;
     int start=0;
     int end = N-1;
     while(start <= end)
     {
        int mid = start+(end-start)/2;
        if(a[mid] > s)
        {
          end=mid-1;
        }else if(a[mid] < s)
        {
          start=mid+1;
        }else
        {
          return mid;
        }
     }
     return -(start+1);
  }