二分查找算法(非递归)

简介

代码实现

package com.xz.binarysearchnorecursion;

/**
 * @author 许正
 * @version 1.0
 */
public class BinarySearchNoRecur {
    public static void main(String[] args) {
        //测试
        int[] arr = {1, 3, 8, 10, 11, 67, 100};
//        int arr[] = {1, 2, 3, 4, 5, 6};
        int index = binarySearch(arr, 100);
        System.out.println("index=" + index);//
    }

    /**
     * @param arr    待查找的数组,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 (target < arr[mid]) {
                right = mid - 1;//向左查找
            } else {
                left = mid + 1;//向右查找
            }
        }
        return -1;
    }
}