java数据结构和算法------折半查找

package iYou.neugle.search;

public class Binary_search {
    public static int BinarySearch(double[] array, double key) {
        int left = 0;
        int right = array.length - 1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (array[mid] == key) {
                return mid;
            } else if (array[mid] > key) {
                right = mid - 1;
            } else if (array[mid] < key) {
                left = mid + 1;
            }
        }
        return -1;
    }
}