Java 给定一个有序整型数组, 实现二分查找

---

一、代码实现

public static int binarySearch(int[] array,int key) {
	int left=0;
	int right=array.length-1;
	while(left<right){
		int mid=(right-left)/2;
		if(key==array[mid])
			return mid;
		else if(key>array[mid]){
            left=mid+1;
		}
		else
			right=mid-1;
	}
	return 0;
}

---

二、测试用例

public static void main(String[] args) {
	int[] array={1,2,3,4,5,6,7,8,9,10};
    int key=5;
    int num=binarySearch(array,key);
    System.out.println(num);
}

---

三、运行结果