fixed.java

// Given an array of n distinct integers sorted in ascending order, write a function that returns a Fixed Point in the array
// http://www.geeksforgeeks.org/find-a-fixed-point-in-a-given-array/

class FixedPoint {

  public static void main(String[] args) {
    int[] arr={0, 3, 7};
    fixed(arr);
  }

  public static void fixed(int[] a)
  {
       int l = 0;
       int h = a.length-1;
       int mid = -1;
      
       while(l<=h){
         mid = (l+h)/2;
           
         //System.out.println(" Mid " + mid + " High " + h + " low " + l);
         if(a[mid] == mid) 
         {
             System.out.println(" Fixed " + mid);
             return;
         }
           
         if( a[mid] > mid)
         {
             //System.out.println("Shift Left");
             h = mid - 1;
         } else {
             //System.out.println("Shift Right");
             l = mid + 1;
         } 
       }
       //System.out.println(" Mid " + mid + " High " + h + " low " + l);
       
      System.out.println(" No Results ");
      return;
  }
}