二分查找算法实现

package com.yyj.algorithm;

public class BinarySearch {

    public static void main(String[] args) {
        int[] arr = new int[]{1, 42, 111, 119, 189, 190, 219};
        System.out.println("index=" + binarySearch(arr, 1));
        System.out.println("index=" + binarySearch(arr, 11));
        System.out.println("index=" + binarySearch(arr, 111));
        System.out.println("index=" + binarySearch(arr, 219));

        System.out.println("=========================================================");

        System.out.println("index=" + binarySearch(arr, 1, 0, arr.length - 1));
        System.out.println("index=" + binarySearch(arr, 111, 0, arr.length - 1));
        System.out.println("index=" + binarySearch(arr, 219, 0, arr.length - 1));
        System.out.println("index=" + binarySearch(arr, 11, 0, arr.length - 1));
    }

    /**
     * 非递归实现二分查找
     *
     * @param arr
     * @param target
     * @return
     */
    public static int binarySearch(int[] arr, int target) {
        int left = 0;
        int right = arr.length;

        while (left <= right) {
            int mid = (left + right) / 2;
            if (arr[mid] == target) {
                return mid;
            } else if (arr[mid] > target) {
                right = mid - 1;
            } else if (arr[mid] < target) {
                left = mid + 1;
            }
        }
        return -1;
    }

    /**
     * 递归实现二分查找
     *
     * @param arr
     * @param target
     * @param left
     * @param right
     * @return
     */
    public static int binarySearch(int[] arr, int target, int left, int right) {
        int mid = (left + right) / 2;
        if (arr[mid] == target) {
            return mid;
        } else if (left >= right) {
            return -1;
        } else if (arr[mid] > target) {
            right = mid - 1;
        } else if (arr[mid] < target) {
            left = mid + 1;
        }
        return binarySearch(arr, target, left, right);
    }
}

输出：
index=0
index=-1
index=2
index=6
=========================================================
index=0
index=2
index=6
index=-1