Demonstration

A simple demonstration program is shown in Figure 3.4.

Figure 3.4: A demonstration program for queues.

import java.util.Random;
import DataStructures.*;

public class QueueDemo {

    public static void main(String[] args) {
        
        Queue q = new QueueArray();
        Random r = new Random();

        System.out.print("insert:");
        for (int count = 0; count < 8; count++) {
            int item = r.nextInt(100);
            System.out.print(" " + item);
            q.enqueue(new Integer(item));
        }
        System.out.println();
 
        System.out.print("remove:");
        while (!q.isEmpty()) {
            System.out.print(" " + q.dequeue());
        }
        System.out.println();

    }
}

This takes 8 random numbers and places them in a queue. It then dequeues them, returning them in the same order in which they were queued.