1-4 测试查找算法的性能

生成有顺序的数组

public class ArrayGenerator {
    private ArrayGenerator(){}

    public static Integer[] generateOrderedArray(int n){
        Integer[] arr = new Integer[n];
        for (int i = 0; i < n; i++) {
            arr[i] = i;
        }
        return arr;
    }
}

测试时间

• 1000000个数据和10000000个数据
• 分别运行100次
• 取秒

public static void main(String[] args) {
        int [] dataSize = {1000000,10000000};
        for(int n:dataSize){
            Integer[] data = ArrayGenerator.generateOrderedArray(n);
            long start = System.nanoTime();//纳秒
            for (int i = 0;i < 100; i++) {
                LinearSearch.search(data,n);
            }
            long end = System.nanoTime();
            double time = (end-start)/1000000000.0;
            System.out.println("n = "+ n + ",100 runs " + time + "s");

        }
    }