二分查找算法

public static int getIndex(int[] arr,int value ){
int min = 0;
int max = arr.length - 1;
int mid = (min + max) / 2;

while(arr[mid] != value){
if(arr[mid] < value){
min = mid + 1;
}else if(arr[mid] > value){
max = mid - 1;
}

mid = (min + max)/2;

if(min > max){
return -1;
}
}
return mid;
}
}