魔术索引

package com.NodePair;


public class MagicIndex {
public static int MagicIndex(int[] array,int start,int end)
{
 if(end<start||start<0||end>=array.length)
return -1;
int mid=(start+end)/2;
int midvalue=array[mid];
if(midvalue==mid)
return mid;


int leftindex=Math.min(mid-1,midvalue);
int left=MagicIndex(array,start,leftindex);
if(left>=0)
return left;


int rightindex=Math.max(midvalue,mid+1);
int right=MagicIndex(array,rightindex,end);
if(right>=0)
return right;
}


public static int magicIndex(int[] array)
{
return MagicIndex(array,0,array.length-1);
}
}