package cn.mrlij.search;
import java.util.Arrays;
/**
* 插值计算:在二分查找的基础上,将原先的int mid = (left+right)/2 ==>
* 改为int mid = left+(right-left)*((findVal-arr[left])/(arr[right]-arr[left]))
* mid变为自适应,适合数据大且分布均匀的数据
*
*/
public class InsertValSearch {
public static void main(String[] args) {
int arr[] = new int[100];
for (int i = 0; i < 100; i++) {
arr[i]+=i;
}
System.out.println(Arrays.toString(arr));
}
public int insertValSearch(int[] arr,int left,int right,int findVal){
//自适应的mid findVal<arr[0] || findVal>arr[arr.length-1] 条件不可省略,在计算mid的时候,可能会
//超过数组的索引
if(left>right|| findVal<arr[0] || findVal>arr[arr.length-1]){
return -1;
}
int mid = left+(right-left)*((findVal-arr[left])/(arr[right]-arr[left]));
int midVal = arr[mid];
if(findVal>midVal){
return insertValSearch(arr,mid+1,right,findVal);
}else if(findVal<midVal){
return insertValSearch(arr,left,mid-1,findVal);
}else {
return mid;
}
}
}