Java实现二分查找算法

Java实现二分查找

public class BinarySearching {
    public static int searching(int[] arr, int key) {
        int mid;
        int low = 0;
        int high = arr.length - 1;
        while (low < high) {
            mid = (low + high) / 2;
            if (arr[mid] < key) {
                low = mid + 1;
            } else if (arr[mid] > key) {
                high = mid - 1;
            } else {
                return mid;
            }
        }
        return -1;
    }

    public static void main(String[] args) {
        int[] arr = {1, 2, 4, 5, 6, 7, 9};
        int key = 5;
        System.out.println(searching(arr, key));
    }
}