public static int binarSearch(int [] arr,int value) {
int max =arr.length-1;
int min = 0;
int mid;
while(max<=min) {
mid = (max+min)>>>1;
if(arr[mid]<value) {
min = mid+1;
}
else if(arr[mid]>value) {
max = mid -1;
}
else
return mid;
}
return -(min+1);
} |
|