-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQueues.java
More file actions
123 lines (76 loc) · 2.35 KB
/
Queues.java
File metadata and controls
123 lines (76 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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
package DS;
/**
*
* @author Dell
*/
public class Queues {
//head pointing to null location and tail pointing to first location in array.
public static int head = -1;
public static int tail = 0;
public static int front(int[] A) {
return (head + 1) % A.length;
}
public static boolean isEmpty() {
if (head == -1 && tail == 0) {
return true;
} else {
return false;
}
}
public static boolean isFull(int[] A) {
if ((tail + 1) % A.length == head) {
return true;
} else {
return false;
}
}
public static void enqueue(int[] A, int e) {
//to check if the queue is full
if (isFull(A) == true) {
System.out.println("Overflow");
}
//to check is queue is empty
else if (isEmpty() == true) {
A[(head + 1) % A.length] = e;
tail = (tail + 1) % A.length;
head = (head + 1) % A.length;
System.out.println("success");
} else {
A[(tail + 1) % A.length] = e;
tail = (tail + 1) % A.length;
System.out.println("Success");
}
}
public static void dequeue(int[] A) {
if (isEmpty() == true) {
System.out.println("Underflow");
} else if (head == tail) {
head = -1;
tail = 0;
} else {
//in circular fashion we dequeue the queue , and return the head using modulus operator.
head = (head + 1) % A.length;
System.out.println(A[((head + A.length) - 1) % A.length]);
}
}
public static void peek(int[] A) {
if (isEmpty() == false) {
System.out.println(A[(head % A.length)]);
} else {
return;
}
}
public static int tail(int[] A){
if(!isEmpty()){
return (tail - 1);
}
else{
return -1;
}
}
}