Java二分查找

package com.test.day1;

//二分查找2013年5月19日15:38:43
public class Binarysearch {
	
	public static void main(String[] args) {
		int[] array=new int[]{2,4,6,8,10,12};
	    System.out.println(Binarysearch.binary_search(array, array.length, 8));
	}
	
	/**
	 * 查找函数
	 * @param array:带查找的数组
	 * @param n :数组的个数
	 * @param value：待查找的元素值
	 * @return
	 */
	public static int binary_search(int array[], int n, int value) {
		int low = 0, mid , high = n-1;
		
		while (low <= high) {
			mid = (low + high) / 2;
			if (array[mid] == value)
				return mid;
			if (array[mid] < value)
				low = mid + 1;
			if (array[mid] > value)
				high = mid - 1;
		}
		
		return -1;
	}

}