-
Notifications
You must be signed in to change notification settings - Fork 0
/
ComplexityTest.java
51 lines (43 loc) · 1.3 KB
/
ComplexityTest.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
package com.yan.queue;
import org.junit.After;
import org.junit.Before;
import org.junit.Test;
import org.junit.runner.RunWith;
import org.junit.runners.JUnit4;
import java.util.Random;
/**
* @author Administrator
* @since 1.0.0
* 2019/10/17 0017 17:47
*/
@RunWith(JUnit4.class)
public class ComplexityTest {
@Before
public void before() {
}
private double test_queue(Queue<Integer> q, int opCount) {
long startTime = System.nanoTime();
Random random = new Random();
for (int i = 0; i < opCount; i++) {
q.enqueue(random.nextInt());
}
for (int i = 0; i < opCount; i++) {
q.dequeue();
}
long endTime = System.nanoTime();
return (endTime - startTime) / 1000000000.0;
}
@Test
public void test() {
int opCount = 100000;
LoopQueue<Integer> queue = new LoopQueue<>();
System.out.println("LoopQueue: " + test_queue(queue, opCount));
ArrayQueue<Integer> integerArrayQueue = new ArrayQueue<>();
System.out.println("ArrayQueue: " + test_queue(integerArrayQueue, opCount));
Queue<Integer> linkedListQueue = new LinkedListQueue<>();
System.out.println("LinkedListQueue: " + test_queue(linkedListQueue, opCount));
}
@After
public void after() {
}
}