3.插值查找

3.插值查找

插值查找是在折半查找的基础上进行优化，将mid改进

mid = low+ （key-arr[low])/(arr[high-arr[low])*(high-low)

public class InterpolationSearch {
        public static void main(String[] args) {
            int[]arr = {1,2,1,5,48,6,3,6,89,5,1,2,63,47,56,30};
            int key = 30;
            int index  = interpolationSearch(arr,key,0,arr.length-1);
            System.out.println("index:"+index);
        }
        private static int interpolationSearch(int[] arr, int key, int low, int high) {
            if (low>high){
                return -1;
            }
            int mid = low +(int) (1.0*(key-arr[low])/(arr[high]-arr[low])*(high-low));
            if (mid<low||mid>high){
                return -1;
            }
            if (arr[mid]==key){
                return mid;
            }
            if (arr[mid]>key){
                return interpolationSearch(arr,key,low,mid-1);
            }
            else{
                return interpolationSearch(arr,key,mid+1,high);
            }
        }
    }