public static int search(int[] array,int left,int right,int target){
if (left>right||target<array[0]||target>array[array.length-1]){
return -1;
}
int mid =left + (right-left)*(target-array[left])/(array[right]-array[left]);
int midvalue = array[mid];
while (left<right){
if (midvalue==target){
break;
}else if(midvalue>target){
search(array,left,mid-1,target);
}else {
search(array,mid+1,right,target);
}
}
return mid;
}
循环多余了,left和right值在当层递归无改变导致死循环。