基本查找
package A01_SearchDemo1;
import java.util.ArrayList;
public class BasicSearchDemo {
public static void main(String[] args) {
int[] Arr={131,127,147,81,103,23,7,79,81};
ArrayList<Integer> list1=BasicSearch(81,Arr);
for (int i = 0; i < list1.size(); i++) {
Integer index=list1.get(i);
System.out.println(index);
}
}
public static ArrayList<Integer> BasicSearch(int i, int[] arr){
ArrayList<Integer> list=new ArrayList<>();
for (int i1 = 0; i1 < arr.length; i1++) {
if(i==arr[i1]){
list.add(i1);
}
}
return list;
}
}
二分查找
package A01_SearchDemo1;
public class BinarySearchDemo {
public static void main(String[] args) {
int[] Arr={7,23,79,81,103,127,131,147};//注意二分查找的适用条件是数组中的数据必须是有序的
int result=BinarySearch(Arr,81);
System.out.println(result);
}
public static int BinarySearch(int[] arr,int num){
int min=0;
int max=arr.length-1;
while(true){
if(min>max){//循环结束写在最上面,因为循环开头min和max才被更新
return -1;
}
int mid=(min+max)/2;
if(arr[mid]==num){
return mid;
}
else if(arr[mid]<num){
min=mid+1;
}
else if(arr[mid]>num){
max=mid-1;
}
}
}
}
二分查找改进之插值查找
package A01_SearchDemo1;
public class BinarySearchDemo {
public static void main(String[] args) {
int[] Arr={1,2,3,4,5,6,7,8,9,10};//注意差值查找适用于数组中的元素是均匀分布的
int result=BinarySearch(Arr,3);
System.out.println(result);
}
public static int BinarySearch(int[] arr,int num){
int min=0;
int max=arr.length-1;
while(true){
if(min>max){//循环结束写在最上面,因为循环开头min和max才被更新
return -1;
}
int mid=min+(num-arr[min])/(arr[max]-arr[min])*(max-min);//差值查找的主要公式
if(arr[mid]==num){
return mid;
}
else if(arr[mid]<num){
min=mid+1;
}
else if(arr[mid]>num){
max=mid-1;
}
}
}
}