二分法查找

package com.gem.JavaHomeworkDay5;

public class BinarySearch {

	public static void main(String[] args) {
		int[] arr = {1,2,3,4,10};
		int num = 5,index = 0;
		int start = 0,end = arr.length;
		for (int i = start; i < end; ) {
			int middle = (start + end) / 2;
			index++;
			if(num > arr[middle]){
				start = middle;		
			}
			else if(num < arr[middle]){
				end = middle;
			}
			else if(num == arr[middle]){
				System.out.println(num + "   " + middle);
				break;
			}
			if(index > arr.length){
				System.out.println("不存在！");
				break;
			}
		
		}
		System.out.println("共执行了 ： " + index + " 次 。");
	}

}