java复习值插值查找

插值查找

package learn;
/**
 * 插值查找，二分查找的升级
 * num是要查找的值
 * mid=left+(right-left)*(num-array[left])/(array[right]-array[left])
 */
public class InsertSearcj {
    public static int binarySearch(int[] array,int left,int right,int num){
        if(left>right||numarray[right]){
            return -1;
        }
        int mid=left+(right-left)*(num-array[left])/(array[right]-array[left]);
        if(num>array[mid]){
            return binarySearch(array,mid+1,right,num);
        }else if(num