8、二分查找 JAVA实现

public class BinarySearch {
	private static boolean binarySearch(int data[],int key){//注意返回值类型为boolean
		int front = 0;
		int tail = data.length-1;
		while(front <= tail){//判断是否能再二分
			int middle = (front+tail)/2;//找中间位置
			if(data[middle] == key){
				System.out.println("要查找的元素所在位置为：");
				 System.out.println(middle);//输出元素位置
				 return true;//返回值
			   
			}
			else
				if(data[middle] < key)
					front = middle+1;
				else
					tail = middle=1;
		}
                System.out.println("未找到该元素");
		return false;//未找到，返回false
	}
	
	public static void main(String[] args){
		int[] array = new int[] { 1, 2, 3, 5, 7, 9, 17, 121, 4545 };
		        System.out.println(binarySearch(array, 4545));

	}
}