-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathcircularQueue.c
More file actions
94 lines (87 loc) · 2.05 KB
/
circularQueue.c
File metadata and controls
94 lines (87 loc) · 2.05 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
#include <stdio.h>
#define max 4
int queue[max]; // array declaration
int front = -1;
int rear = -1;
// function to insert an element in a circular queue
void enqueue(int element)
{
if (front == -1 && rear == -1) // condition to check queue is empty
{
front = 0;
rear = 0;
queue[rear] = element;
}
else if ((rear + 1) % max == front) // condition to check queue is full
{
printf("Queue is overflow..");
}
else
{
rear = (rear + 1) % max; // rear is incremented
queue[rear] = element; // assigning a value to the queue at the rear position.
}
}
// function to delete the element from the queue
int dequeue()
{
if ((front == -1) && (rear == -1)) // condition to check queue is empty
{
printf("\nQueue is underflow..");
}
else if (front == rear)
{
printf("\nThe dequeued element is %d", queue[front]);
front = -1;
rear = -1;
}
else
{
printf("\nThe dequeued element is %d", queue[front]);
front = (front + 1) % max;
}
}
// function to display the elements of a queue
void display()
{
int i = front;
if (front == -1 && rear == -1)
{
printf("\n Queue is empty..");
}
else
{
printf("\nElements in a Queue are : ");
while (i <= rear)
{
printf("%d,", queue[i]);
i = (i + 1) % max;
}
}
}
int main()
{
int choice = 1, x; // variables declaration
printf("\nPress 1: Insert an element");
printf("\nPress 2: Delete an element");
printf("\nPress 3: Display the element");
while (choice < 4 && choice != 0) // while loop
{
printf("\nEnter your choice : ");
scanf("%d", &choice);
switch (choice)
{
case 1:
printf("Enter the element which is to be inserted : ");
scanf("%d", &x);
enqueue(x);
break;
case 2:
dequeue();
break;
case 3:
display();
}
}
return 0;
}