5-6 数组队列饿汉循环队列性能的比较

【实现代码】

分别进行10 万次出队 和 入队

public class Main {
    //测试使用q 运行opCount 个 enqueue 和 的dequeue 操作所需要的时间，单位：秒
    private static double testQueue(Queue<Integer> q,int opCount){
        long start = System.nanoTime();
        Random random = new Random();
        for (int i = 0; i < opCount; i++) {
            q.enqueue(random.nextInt(Integer.MAX_VALUE));
        }
        for (int i = 0; i < opCount; i++) {
            q.dequeue();
        }

        long end = System.nanoTime();

        return (end - start) / 1000000000.0;
    }
    public static void main(String[] args) {
        int opCount = 100000;
        ArrayQueue<Integer> arrayQueue = new ArrayQueue<>();
        double time1 = testQueue(arrayQueue,opCount);
        LoopQueue<Integer> loopQueue = new LoopQueue<>();
        double time2 = testQueue(loopQueue,opCount);

        System.out.println("ArrayQueue, Time: " + time1 +" s");
        System.out.println("LoopQueue, Time: " + time2 +" s");

    }
}

【结果】

ArrayQueue, Time: 9.9926637 s
LoopQueue, Time: 0.0087786 s