-
Notifications
You must be signed in to change notification settings - Fork 10
Expand file tree
/
Copy pathQueue.java
More file actions
120 lines (98 loc) · 2.99 KB
/
Queue.java
File metadata and controls
120 lines (98 loc) · 2.99 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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
import java.util.*;
class Queue {
private static int start, end, capacity;
private static int queue[];
Queue(int size) {
start = end = 0;
capacity = size;
queue = new int[capacity];
}
// insert an element into the queue
static void queueEnqueue(int item) {
// check if the queue is full
if (capacity == end) {
throw new ArrayOutOfBoundsException("the size of the queue is full");
return;
}
// insert element at the end
else {
queue[end] = item;
end++;
}
return;
}
//remove an element from the queue
static void queueDequeue() {
// check if queue is empty
if (start == end) {
throw new EmptyQueueException();
return;
}
// shift elements to the right by one place uptil end
else {
for (int i = 0; i < end - 1; i++) {
queue[i] = queue[i + 1];
}
// set queue[end] to 0
if (end < capacity)
queue[end] = 0;
// decrement end
end--;
}
return;
}
// print queue elements
static void queueDisplay()
{
int i;
if (start == end) {
System.out.printf("Queue is Empty\n");
return;
}
// traverse start to end and print elements
for (i = start; i < end; i++) {
System.out.printf(" %d = ", queue[i]);
}
return;
}
// print start of queue
static void queuestart()
{
if (start == end) {
System.out.printf("Queue is Empty\n");
return;
}
System.out.printf("\nstart Element of the queue: %d", queue[start]);
return;
}
}
public class Main {
public static void main(String[] args) {
// Create a queue of capacity 4
Queue q = new Queue(4);
System.out.println("Initial Queue:");
// print Queue elements
q.queueDisplay();
// inserting elements in the queue
q.queueEnqueue(10);
q.queueEnqueue(30);
q.queueEnqueue(50);
q.queueEnqueue(70);
// print Queue elements
System.out.println("Queue after Enqueue Operation:");
q.queueDisplay();
// print start of the queue
q.queuestart();
// insert element in the queue
q.queueEnqueue(90);
// print Queue elements
q.queueDisplay();
q.queueDequeue();
q.queueDequeue();
System.out.printf("\nQueue after two dequeue operations:");
// print Queue elements
q.queueDisplay();
// print start of the queue
q.queuestart();
}
}