-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCircularqueue.c
66 lines (63 loc) · 1.55 KB
/
Circularqueue.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
#include <stdio.h>
#include <stdlib.h>
#define size 5
int circularqueue[size];
int front = -1; int rear = -1;
int enqueue(int data);
int dequeue();
int display();
int main() {
int ch , data;
while(1){
printf("----------Operations of Circular Queue-----------\n");
printf("1. Enqueue\n");
printf("2. Dequeue\n");
printf("3. Display\n");
printf("4. Exit\n");
printf("Enter Your Choice : \n");
scanf("%d" , &ch);
switch(ch){
case 1:printf("Enter a Number : \n");
scanf("%d" , &data);
enqueue(data);
break;
case 2: dequeue();
break;
case 3: display();
break;
case 4: exit(0);
break;
default: printf("Invalid Choice!\n");
}
}
return 0;
}
int enqueue(int data){
if((rear+1)% size == front){
printf("Queue is full!\n");
}
if(rear == -1 && front == -1){
rear = front = 0;
circularqueue[rear] = data;
} else{
rear = (rear+1)%size;
circularqueue[rear] = data;
}
}
int dequeue(){
if(rear == -1 && front == -1){
printf("Queue is Empty!\n");
}
if(rear == front){
front = -1;
rear = -1;
}
else{
front = (front+1)%size;
}
}
int display(){
for(int i = front; i <= rear ; i++){
printf("%d\t" , circularqueue[i]);
} printf("\n");
}