Java implements interpolation search

 Idea:

 

Binary search: Binary searchhttps://blog.csdn.net/qq_52135683/article/details/122024016?spm=1001.2014. 3001.5501

 Code logic:

Use this algorithm to find all target value subscripts in the array

package 查找算法;

import java.util.Scanner;

public class InsertSearch {
	public static void main(String[] args) {
		int[]arr= {1,5,7,9,10,10,10,45,100,158};
		Scanner sc=new Scanner(System.in);
		int target=sc.nextInt();
		boolean isFind=false;
		insertSearch(arr,0,arr.length-1,isFind,target);
	}

	private static void insertSearch(int[] arr, int i, int j, boolean isFind,int target) {
		if(i>j) {
			if(isFind==false)
				System.out.println("not find");
			return;
		}
		
		int low=i;
		int high=j;
		int insertIndex=low+(arr[high]-arr[low])*(high-low)/(arr[high]-arr[low]);
		if(arr[insertIndex]==target) {
			System.out.println("index:"+insertIndex);
			isFind=true;
			insertSearch(arr,low,insertIndex-1,isFind,target);
			insertSearch(arr,insertIndex+1,high,isFind,target);
			
			
		}
		if(arr[insertIndex]>target) {
			insertSearch(arr,low,insertIndex-1,isFind,target);
		}
		if(arr[insertIndex]<target) {
			insertSearch(arr,insertIndex+1,high,isFind,target);
		}
		
	}

}