binary search

public class ArrayTest2 {
	
	public static void main(String[] args) {
		
		boolean isFlag = true;
		
		// Binary search ：( be familiar with )
		// Premise ： The array to be found must be ordered .
		int[] arr2 = new int[]{-98,-34,2,34,54,66,79,105,210,333};
		
		int dest1 = -34;
		dest1 = 35;
		int head = 0;// Initial first index 
		int end = arr2.length - 1;// Initial last index 
		boolean isFlag1 = true;
		while(head <= end){
			
			int middle = (head + end)/2;
			
			if(dest1 == arr2[middle]){
				System.out.println(" The specified element was found , The position is ：" + middle);
				isFlag1 = false;
				break;
			}else if(arr2[middle] > dest1){
				end = middle - 1;
			}else{//arr2[middle] < dest1
				head = middle + 1;
			}

			
		}
		
		if(isFlag1){
			System.out.println(" unfortunately , Not found ！");
		}
		
		
	}
}