插值查找（Java）

package search;

import static java.lang.Math.max;
import static java.lang.Math.min;

public class InsertSearch {
    public static void main(String[] args) {
        int[] array = {1, 2, 3, 4, 5, 6, 7, 8};
        // 适合分布均匀的数据
        insertSearch(3, array);
    }

    public static int index(int n, int l, int r, int[] a){
        return l + (n - a[l]) / (a[r] - a[l]) * (r - l);
    }

    public static void insertSearch(int n,int[] a) {
        int l = 0;
        int r = a.length - 1;
        while (l <= r) {
            int k = index(n, l, r, a);
            // 防止下标越界
            int x = max(l, min(k, r));

            if (a[x] == n) {
                System.out.println("查找成功");
                return;
            }
            if (a[x] < n) {
                l = x + 1;
            }
            if (a[x] > n) {
                r = x - 1;
            }
        }
        System.out.println("查找失败");
    }
}