package search;

/**
 * @author chenyi
 * @Description 插值查找
 * @date 2022/2/16 9:53
 */
public class BinaryValueSearch {

    public int solution(int[] arr, int l, int r, int target) {
        if (l > r || arr[l]>target || arr[r]<target) {
            return -1;
        }
        int m = l+(r-l)*(target-arr[l])/(arr[r]-arr[l]);
        if (arr[m] < target) {
            return solution(arr, m + 1, r, target);
        } else if (arr[m] > target) {
            return solution(arr, l, m - 1, target);
        }
        return m;
    }


    public static void main(String[] args) {
        int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9};
        int idx = new BinaryValueSearch().solution(arr, 0, arr.length-1, 9);
        System.out.println(idx);
    }

}