QUEUE IMPLEMENTATION

package data_structures;

//Creating a class Queue to implement the data structure Queue

public class Queue1{

public static int Queue[];
public static int rear;
public static int front;
public static int size;

Queue1(int n) {
front=rear=0;
size=n;
Queue=new int[n];
}

//Function defined to enqueue elements to this queue

static void insert(int x) {

if(size==rear) {
System.out.println("Queue Overflow");
}
else {
Queue[rear]=x;
rear++;
}
}

//Function defined to dequeue elements from this queue

static void delete() {

if(front==rear) {
System.out.println("Queue is empty");
}
else {
for(int i=0;i<rear-1;i++) {
Queue[i]=Queue[i+1];
}
if(rear<size)
Queue[rear]=0;
rear--;
}
return;
}

//Function to display the elements of the queue

static void display() {

if(front==rear) {
System.out.println("Queue is empty");
}
for(int i=front;i<rear;i++) {
System.out.println(Queue[i]);
}
}
//Main Block

public static void main(String[] args) {

//Creating a queue of size-10
Queue1 Q = new Queue1(10);
//Enqueue 6
Queue1.insert(6);
//Enqueue 7
Queue1.insert(7);
//Enqueue 8
Queue1.insert(10);
//Enqueue 5
Queue1.insert(5);
//Enqueue 4
Queue1.insert(4);
//Enqueue 2
Queue1.insert(2);
//Enqueue 1
Queue1.insert(1);
//Enqueue 3
Queue1.insert(3);
//Enqueue 8
Queue1.insert(8);
//Enqueue 9
Queue1.insert(9);
//Enqueue 10
Queue1.insert(10);
//Dequeue an element
Queue1.delete();
//Display the elements in the queue
Queue1.display();
Queue1.delete();
Queue1.display();

}
OUTPUT
Queue Overflow
7
10
5
4
2
1
3
8
9

10
5
4
2
1
3
8
9