二分查找的非递归实现

public class BinarySearchNoRecursion {
    public static void main(String[] args) {
        int[] arr = {1, 3, 8, 10, 11, 67, 100};
        System.out.println("索引为:"+binarySearch(arr,11));
    }

    /**
     * @param arr    要进行二分查找的数组,升序排序
     * @param target 要查找的目标
     * @return 返回查找结果, 如果没有找到就返回-1
     */
    public static int binarySearch(int[] arr, int target) {
        int left = 0;
        int right = arr.length - 1;
        while (left <= right) {
            int mid = (left + right) / 2;
            if (arr[mid] == target) {
                return mid;
            } else if (arr[mid] > target) {
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }
        return -1;
    }
}