-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcircular_queue.c
More file actions
112 lines (97 loc) · 2.1 KB
/
circular_queue.c
File metadata and controls
112 lines (97 loc) · 2.1 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
#include<stdio.h>
#include <stdlib.h>
#define SIZE 5
int myQueue[SIZE];
int front = -1, rear = -1, ele;
void enqueue()
{
if((front == 0 && rear == SIZE - 1) || (front == rear+1))
{
printf("Queue is full\n");
}
else
{
printf("Enter the value to be inserted: ");
scanf("%d",&ele);
if(rear == SIZE-1 && front != 0)
myQueue[++rear] = ele;
printf("Inserted %d Successfully!\n", myQueue[rear]);
if(front == -1)
{
front = 0;
}
}
}
void dequeue()
{
if(front == -1 && rear == -1)
printf("Circular Queue is Empty.\n");
else
{
ele = myQueue[front++];
printf("Deleted element is : %d\n",ele);
if(front-1 == rear)
{
front = rear = -1;
}
if(front == SIZE)
{
front = 0;
}
}
}
void display()
{
if(front == -1)
{
printf("Circular Queue is Empty!\n");
}
else
{
int i;
printf("Circular Queue Elements are : \n");
if(front <= rear)
{
for (i=front; i <= rear; i++)
{
printf("%d\t",myQueue[i]);
}
}
else
{
for (i = 0;i <= rear; i++)
printf("%d\t",myQueue[i]);
for (i = front;i <= SIZE - 1; i++)
printf("%d\t", myQueue[i]);
}
}
}
int main()
{
int choice, del;
for(;;)
{
printf("Enter choice :\n");
printf("1. Enqueue\n");
printf("2. Dequeue\n");
printf("3. Display\n");
printf("4. Exit\n");
scanf("%d",&choice);
switch(choice)
{
case 1 :
enqueue();
break;
case 2 :
dequeue();
break;
case 3 :
display();
break;
case 4 :
exit(0);
default :
printf("Invalid choice\n");
}
}
}