Java二分尋找

package com.test.day1;//二分尋找2013年5月19日15:38:43public 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;}}