TestMain.java - MAIN METHOD (Get all of the Time)
PHP Code:
import java.util.Random;
public class TestMain {
public static void main(String[] args) {
int n = 10;
Queue q = new Queue();
Stack s = new Stack();
VectorQueue vq = new VectorQueue();
VectorStack vs = new VectorStack();
double t1 = 0, t2 = 0, r = 0;
boolean passed = false;
// ENQUEUE & PUSH
for (int i = 0; i < n; i++) {
if (!passed) {
t1 = System.nanoTime();
}
q.queue(i);
if (!passed) {
t2 = System.nanoTime();
r = t2 - t1;
System.out.println("ARRAY QUEUE - ENQUEUE: " + r);
}
if (!passed) {
t1 = System.nanoTime();
}
s.push(i);
if (!passed) {
t2 = System.nanoTime();
r = t2 - t1;
System.out.println("ARRAY STACK - PUSH: " + r);
}
if (!passed) {
t1 = System.nanoTime();
}
vq.enqueue(i);
if (!passed) {
t2 = System.nanoTime();
r = t2 - t1;
System.out.println("VECTOR QUEUE - ENQUEUE: " + r);
}
if (!passed) {
t1 = System.nanoTime();
}
vs.push(i);
if (!passed) {
t2 = System.nanoTime();
r = t2 - t1;
System.out.println("VECTOR STACK - PUSH: " + r);
passed = true;
}
}
System.out.println();
passed = false;
// PEEK
for (int i = 0; i < n; i++) {
if (!passed) {
t1 = System.nanoTime();
}
s.peek();
if (!passed) {
t2 = System.nanoTime();
r = t2 - t1;
System.out.println("ARRAY STACK - PEEK: " + r);
}
if (!passed) {
t1 = System.nanoTime();
}
vs.peek();
if (!passed) {
t2 = System.nanoTime();
r = t2 - t1;
System.out.println("VECTOR STACK - PEEK: " + r);
passed = true;
}
}
System.out.println();
passed = false;
// DEQUEUE & POP
for (int i = 0; i < n; i++) {
if (!passed) {
t1 = System.nanoTime();
}
q.dequeue();
if (!passed) {
t2 = System.nanoTime();
r = t2 - t1;
System.out.println("ARRAY QUEUE - DEQUEUE: " + r);
}
if (!passed) {
t1 = System.nanoTime();
}
s.pop();
if (!passed) {
t2 = System.nanoTime();
r = t2 - t1;
System.out.println("ARRAY STACK - POP: " + r);
}
if (!passed) {
t1 = System.nanoTime();
}
vq.dequeue();
if (!passed) {
t2 = System.nanoTime();
r = t2 - t1;
System.out.println("VECTOR QUEUE - DEQUEUE: " + r);
}
if (!passed) {
t1 = System.nanoTime();
}
vs.pop();
if (!passed) {
t2 = System.nanoTime();
r = t2 - t1;
System.out.println("VECTOR STACK - POP: " + r);
passed = true;
}
}
System.out.println();
passed = false;
// SORTED STACK
Random random = new Random();
int range = 100;
VectorSortedStack vss = new VectorSortedStack();
VectorSortedQueue vsq = new VectorSortedQueue();
for (int i = 0; i < n; i++) {
if (!passed) {
t1 = System.nanoTime();
}
vss.push(random.nextInt(range));
if (!passed) {
t2 = System.nanoTime();
r = t2 - t1;
System.out.println("VECTOR SORTED STACK: " + r);
}
if (!passed) {
t1 = System.nanoTime();
}
vsq.enqueue(random.nextInt(range));
if (!passed) {
t2 = System.nanoTime();
r = t2 - t1;
System.out.println("VECTOR SORTED QUEUE: " + r);
passed = true;
}
}
}
}
My Result: (Will be various)
Code:
ARRAY QUEUE - ENQUEUE: 594577.0
ARRAY STACK - PUSH: 5483.0
VECTOR QUEUE - ENQUEUE: 10013.0
VECTOR STACK - PUSH: 6660.0
ARRAY STACK - PEEK: 2396.0
VECTOR STACK - PEEK: 6818.0
ARRAY QUEUE - DEQUEUE: 9540.0
ARRAY STACK - POP: 3202.0
VECTOR QUEUE - DEQUEUE: 9063.0
VECTOR STACK - POP: 5902.0
VECTOR SORTED STACK: 32148.0
VECTOR SORTED QUEUE: 29111.0
IMPORTANT:
To my class mates: Don't just copy and paste!!! 
Don't blame and sue me if you get an F, getting fired, or whatever problem that you may have by using my codes. Use it at your own risk 