Question

求助贴，关于Java递归二分法

Answer 1

public class TwoTest {
	public static void main(String[] args) {
		int[] a = {1,2,3,5,9,11,45,55,95,100,198,201,202,333};
		System.out.println(search(a,100,0,a.length));
		
	}
	public static int search(int[] a,int key,int star,int end){
		if(star > end)
			return -1;
		int mid = (star+end)/2;
		if(a[mid] == key)
			return mid;
		if(a[mid]<key)
			return(search(a,key,mid+1,end));
		return(search(a,key,star,mid-1));
		
	}

}