package Week11.exp3;

import Week11.exp3.cn.edu.besti.cs1723.W2323.SearchingSorting;

public class SearchTest {
    public static void main(String[] args) {
        int[]a = {0, 1, 2, 7, 23, 2323};
        System.out.println("折半查找2323在数组的第" + (SearchingSorting.BinarySearch1(a, 2323, 6) + 1 )+ "位置");
        System.out.println("插值查找23在数组的第" + (SearchingSorting.InsertionSearch(a, 23, 0,5) + 1 )+ "位置");
        System.out.println("顺序查找1在数组的第" + (SearchingSorting.SequenceSearch(a, 1, 6) + 1)+ "位置");
        System.out.println("斐波那契查找2323在数组的第" + (SearchingSorting.FibonacciSearch(a, 6, 2323) + 1) + "位置");
        System.out.println("分块查找是否有2323在数组中" + SearchingSorting.BlockSearch(a, 2323, new int[]{3, 30, 5000}));
        System.out.println("哈希查找2323在数组的第" + (SearchingSorting.hashsearch(a, 2323)+1) + "位置");
        if (SearchingSorting.FibonacciSearch(a, 6, 2222) == -1){
            System.out.println("斐波那契查找没有查找到值2222");
        }
        if (SearchingSorting.SequenceSearch(a, 6, 6) == -1){
            System.out.println("顺序查找没有查找到值6");
        }
        if (SearchingSorting.InsertionSearch(a, 14, 0, 5) == -1){
            System.out.println("插值查找没有查找到值14");
        }
        if (SearchingSorting.BinarySearch1(a, 1120, 6) == -1){
            System.out.println("折半查找没有查找到值1120");
        }

    }
}