Queue Example using Integers (Java)

The following program contains code, how to write a queue data structure for an integer datatype.


import java.io.*;

class IntegerQueue {

public static void main (String args []) {
QueueOperation q = new QueueOperation() ;
q.insert(10);
q.insert(20);
q.insert(30);
q.insert(40);
q.insert(50);
q.insert(60);
q.insert(70);
q.insert(80);

}

}

class QueueOperation {

static int queueArray [] = new int [5] ;
int i = 0 ;

public void insert (int num) {

if (i < 5 ) {
queueArray[i] = num ;
i++ ;
System.out.println("The queue contains: ");
for (int a = 0 ; a < i ; a++)
System.out.println(queueArray[a]) ;
}
else {
for (int b = 0 ; b < i - 1 ; b++) {
queueArray[b] = queueArray[b + 1] ;
}
queueArray[i - 1] = num ;
System.out.println("The queue contains: ");
for (int a = 0 ; a < i ; a++)
System.out.println(queueArray[a]) ;
}

}

}