java实现二分查找

/*
 * 3.实现二分查找
 */
public class BinarySearch {

	public static void main(String[] args) {
		int[] array= {0,1,2,3,4,5,6,7,8,9};
		binarySearch(array, 3);
	}
	public static void binarySearch(int[] array, int num) {
		int min=0;
		int max=array.length-1;
		int mid=(min+max)/2;
		boolean flag=false;
		int index=-1;
		while(min<=max) {
			if(array[mid]==num) {
				flag=true;
				index=mid;
				break;
			}else if(array[mid]<num) {
				min=mid+1;
			}else {
				max=mid-1;
			}
			mid=(max+min)/2;
		}
		if(flag) {
			System.out.println("找到了,下标为："+index);
		}else {
			System.out.println("没找到");
		}
	}

}