forked from iRupam/NewtonSchoolInfinityJune21
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueueImplementationUsingArray.java
More file actions
100 lines (82 loc) · 2.35 KB
/
QueueImplementationUsingArray.java
File metadata and controls
100 lines (82 loc) · 2.35 KB
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
package InfinityJune21.Queue;
public class QueueImplementationUsingArray {
private int maxSize;
private int queueArray[];
private int front;
private int rear;
QueueImplementationUsingArray(int size) {
maxSize = size;
queueArray = new int[maxSize];
front = rear = -1;
}
boolean isFull() {
return (rear == maxSize - 1);
}
boolean isEmpty() {
return (front == -1 || front > rear);
}
void insert(int element) {
System.out.println("Inserting " + element + "...");
if(isFull()) {
System.out.println("Cannot insert. Queue is full");
}
else {
if(front == -1 && rear == -1) {
front = rear = 0;
}
else {
rear = rear + 1;
}
queueArray[rear] = element;
System.out.println("Successfully inserted " + element + "...");
}
}
void delete() {
System.out.println("Deleting...");
if(isEmpty()) {
System.out.println("Cannot delete. Queue is empty");
}
else {
int element = queueArray[front];
System.out.println("Deleted " + element + "...");
front = front + 1;
}
}
void traverse() {
System.out.println("Traversing the queue...");
if(isEmpty()) {
System.out.println("Cannot traverse. Queue is empty");
}
else {
System.out.println("Elements in the queue are: ");
for(int i = front; i <= rear; i++) {
System.out.print(queueArray[i] + " ");
}
System.out.println();
}
}
public static void main(String[] args) {
QueueImplementationUsingArray q = new QueueImplementationUsingArray(7);
q.insert(10);
q.insert(20);
q.insert(30);
q.insert(40);
q.traverse();
q.delete();
q.delete();
q.traverse();
q.insert(50);
q.insert(60);
q.insert(70);
q.insert(80);
q.traverse();
q.delete();
q.delete();
q.delete();
q.delete();
q.delete();
q.delete();
q.traverse();
q.insert(100);
}
}