package search;
import java.util.Arrays;
public class InsertSearch {
public static void main(String[] args) {
int arr[] = { -9,1, 8, 10, 89,1000,1000, 1234 ,3434,1434312};
int index = insertSearch(arr, 0, arr.length - 1, 1234);
System.out.println("index = " + index);
}
public static int insertSearch(int[] arr, int left, int right, int findVal) {
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 insertSearch(arr, mid + 1, right, findVal);
} else if (findVal < midVal) {
return insertSearch(arr, left, mid - 1, findVal);
} else {
return mid;
}
}
}