二分查找法的举例

package 二分查找;

import java.util.Scanner;

public class Binsearch {

	public static void main(String[] args) {
		// TODO 自动生成的方法存根

		Scanner in = new Scanner(System.in);
		System.out.println("请输入你要查找的数：");
		int x=in.nextInt();
//		System.out.println(binSearch(x));
		System.out.println("这个数是 arr["+binSearch(x)+"]");
	}
			
	public static int binSearch(int input) {
		int arr[]= {1,3,8,11,16,19,21,24,26,30};
		int left = 0;
		int right = arr.length-1;
		while(left <= right)
		{
			int middle = (left+right)/2;
			if(input == arr[middle])
				return middle;
			else if(input>arr[middle]) {
				left= middle+1;
			}
			else{
				right = middle -1;
			}
		}
		return -1;
	} 
}