插值查找:
插值查找和二分查找的原理差不多只不过是mid值变了。而且是更精准的二分查找
mid=left + (Val[right] − Val[left]) / (x − Val[left]) × (right − left)
上代码:
public static int insertValue(int[] arr, int left, int right, int value) {
if (left > right || value < arr[0] || value > arr[arr.length - 1]) {
return -1;
}
int mid = left + (right - left) * (value - arr[left]) / (arr[right] - arr[left]);
int midValue = arr[mid];
if (value > midValue) {
return insertValue(arr, mid + 1, right, value);
}else if (value < midValue) {
return insertValue(arr, left, mid - 1, value);
}else {
return mid;
}
}