-
Notifications
You must be signed in to change notification settings - Fork 0
/
Circular_Queues_Operations.java
109 lines (91 loc) · 2.3 KB
/
Circular_Queues_Operations.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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
public class CircularQueue {
int SIZE = 5;
int front, rear;
int items[] = new int[SIZE];
CircularQueue(){
front = -1;
rear = -1;
}
boolean isFull() {
if(front == 0 && rear == SIZE - 1){
return true;
}
if(front == rear + 1){
return true;
}
return false;
}
boolean isEmpty(){
if(front == -1){
return true;
}
else{
return false;
}
}
void enQueue(int element){
if(isFull()){
System.out.println("Queue is Full!!");
}
else{
if(front == -1){
front = 0;
rear = (rear + 1) % SIZE;
items[rear] = element;
System.out.println("Inserted : " + element);
}
}
}
int deQueue(){
int element;
if(isEmpty()){
System.out.println("The queue is empty!!");
return (-1);
}
else{
element = items[front];
if(front == rear){
front = -1;
rear = -1;
}
else{
front = (front + 1) % SIZE;
}
return (element);
}
}
void display(){
int i;
if(isEmpty()){
System.out.println("The queue is Empty.");
}
else{
System.out.println("Front : " + front);
System.out.println("Items : ");
for(i = front; i != rear; i = (i + 1) % SIZE){
System.out.print(items[i] + " ");
System.out.println(items[i]);
System.out.println("Rear : " + rear);
}
}
}
public static void main(String[] args){
CircularQueue queue = new CircularQueue();
queue.deQueue();
queue.enQueue(12);
queue.enQueue(1);
queue.enQueue(7);
queue.enQueue(34);
queue.enQueue(44);
queue.enQueue(32);
queue.display();
int elements = queue.deQueue();
if(elements != -1){
System.out.println("Deleted element : " + elements);
}
queue.display();
queue.enQueue(89);
queue.display();
queue.enQueue(55);
}
}