binarysearch1.java

来自「《算法设计与分析》王晓东编著」· Java 代码 · 共 30 行

public class BinarySearch1 {
	public static int binSearch(int[] array,int x){
		int n = array.length;
		int left = 0;int right = n-1;
		while(left<=right)
		{	int middle=(left+right)/2;
			if(x>array[middle]) left=middle+1;
			else if(x<array[middle]) right=middle-1;
			else return middle;
		}
		return -1;
	}
	public static void main(String args[]){
		int[] array = new int[10];
		System.out.println("Array:");
		for(int i=0;i<10;i++){
			array[i] = i*i;
			System.out.print(array[i]+"\t");
		}
		System.out.println();
		int x = 16;
		System.out.println("X = "+x);
		System.out.println("Searching result: "+binSearch(array,x));
		
	
	}

}