-
Notifications
You must be signed in to change notification settings - Fork 1
/
circularq.c
139 lines (113 loc) · 2.57 KB
/
circularq.c
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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#include <stdio.h>
#include <stdlib.h>
#define MAX 6
#define true 1
#define false 0
#define bool int
int arr[MAX];
int s, e;
void EnQ(int val)
{
if (IsQFull())
printf("Cant enter val [%d], coz Q is FULL", val);
else {
if (s == MAX) {
s = 0;
arr[s] = val;
s++;
} else {
arr[s] = val;
s++;
}
}
}
int DeQ(void)
{
if (IsQEmpty()) {
printf("Cant dequeue coz Q is Emplty");
return -100;
}
if (e == MAX-1) {
int temp = arr[e];
e = -1;
if (s == MAX)
s = 0;
return temp;
} else if (e == -1){
e = 1;
return arr[0];
} else {
int temp = arr[e];
e++;
return temp;
}
}
bool IsQEmpty()
{
if ((e == -1 && s == 0) || (((s-e) == 1) && (s != MAX))) {
return true;
} else {
return false;
}
}
bool IsQFull()
{
if ((s == MAX && e == -1) || (e == s)) {
return true;
} else {
return false;
}
}
int main()
{
/*Initialize start and end pointers */
s = 0;
e = -1;
int val;
printf("Q Empty status [%d]\n", IsQEmpty());
printf("Q Full status [%d]\n", IsQFull());
printf("Enter Item to be queued\n");
scanf("%d", &val);
EnQ(val);
printf("Enter Item to be queued\n");
scanf("%d", &val);
EnQ(val);
printf("Enter Item to be queued\n");
scanf("%d", &val);
EnQ(val);
printf("Enter Item to be queued\n");
scanf("%d", &val);
EnQ(val);
printf("Enter Item to be queued\n");
scanf("%d", &val);
EnQ(val);
printf("Enter Item to be queued\n");
scanf("%d", &val);
EnQ(val);
printf("\nQ Empty status [%d]\n", IsQEmpty());
printf("Q Full status [%d]\n", IsQFull());
printf("\n DeQueued val [%d]", DeQ());
printf("\n DeQueued val [%d]", DeQ());
printf("\n DeQueued val [%d]", DeQ());
//printf("\n DeQueued val [%d]", DeQ());
//printf("\n DeQueued val [%d]", DeQ());
//printf("\n DeQueued val [%d]", DeQ());
printf("Enter Item to be queued\n");
scanf("%d", &val);
EnQ(val);
printf("Enter Item to be queued\n");
scanf("%d", &val);
EnQ(val);
printf("Enter Item to be queued\n");
scanf("%d", &val);
EnQ(val);
printf("Enter Item to be queued\n");
scanf("%d", &val);
EnQ(val);
printf("Enter Item to be queued\n");
scanf("%d", &val);
EnQ(val);
printf("\n DeQueued val [%d]", DeQ());
printf("\nQ Empty status [%d]\n", IsQEmpty());
printf("Q Full status [%d]\n", IsQFull());
}