数组二分算法代码

public class Test01 {
public static void main(String[] args) {
int[] arr = {1,3,5,7,9};
int index = Search(arr, 7); //调用下面方法查找下标index
System.out.println(index = = -1 ? “无法查找到该元素” : “该元素下标为:” + index);
}
public static int Search(int[] arr, int i) {
int begin = 0; //开始下标为0
int end = arr.length - 1; //结束下标为数组长度-1
while (begin <= end) {
int mid = (begin + end) / 2;
if (arr[mid] == i) {
return mid;
} else if (arr[mid] < i) {
begin = mid + 1;
} else {
end = mid - 1;
}
}
return -1;
}
}