Java实现分叉查找--递归方法

二分查找又称折半查找，它是一种效率较高的查找方法。 

　　【二分查找要求】：1.必须采用顺序存储结构 2.必须按关键字大小有序排列

package 排序算法;

public class 快排 {
	public static void main(String[] args) {
		int[] src = new int[] { 1, 3, 5, 7, 9 };
		System.out.println(binarySearch(src, 9, 0, src.length-1));
	}

	private static int binarySearch(int[] dataset, int data, int begin, int end) {
		int middle = (begin + end)/2;
		if(data < dataset[middle]){
			end = middle-1;
			return binarySearch(dataset, data, begin, end);
		}else if(data > dataset[middle]){
			begin = middle+1;
			return binarySearch(dataset, data, begin, end);
		}else
			return middle;
	}

}