forked from dimpeshmalviya/C-Language-Programs
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCircular_Queue.c
More file actions
96 lines (85 loc) · 2.22 KB
/
Circular_Queue.c
File metadata and controls
96 lines (85 loc) · 2.22 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
#include <stdio.h>
#include <stdlib.h>
#define SIZE 5 // maximum size of the circular queue
int queue[SIZE];
int front = -1, rear = -1;
// Function to check if queue is full
int isFull() {
return (front == 0 && rear == SIZE - 1) || (rear + 1 == front);
}
// Function to check if queue is empty
int isEmpty() {
return (front == -1);
}
// Function to insert (enqueue) an element
void enqueue(int value) {
if (isFull()) {
printf("Queue is full! (Overflow)\n");
} else {
if (front == -1) // first element
front = 0;
rear = (rear + 1) % SIZE; // circular increment
queue[rear] = value;
printf("Inserted %d into the queue.\n", value);
}
}
// Function to delete (dequeue) an element
void dequeue() {
if (isEmpty()) {
printf("Queue is empty! (Underflow)\n");
} else {
printf("Deleted %d from the queue.\n", queue[front]);
if (front == rear) {
// Only one element was present
front = rear = -1;
} else {
front = (front + 1) % SIZE; // circular increment
}
}
}
// Function to display the queue
void display() {
if (isEmpty()) {
printf("Queue is empty.\n");
} else {
printf("Queue elements are: ");
int i = front;
while (1) {
printf("%d ", queue[i]);
if (i == rear)
break;
i = (i + 1) % SIZE;
}
printf("\n");
}
}
int main() {
int choice, value;
while (1) {
printf("\n--- Circular Queue Menu ---\n");
printf("1. Enqueue\n");
printf("2. Dequeue\n");
printf("3. Display\n");
printf("4. Exit\n");
printf("Enter your choice: ");
scanf("%d", &choice);
switch (choice) {
case 1:
printf("Enter value to insert: ");
scanf("%d", &value);
enqueue(value);
break;
case 2:
dequeue();
break;
case 3:
display();
break;
case 4:
exit(0);
default:
printf("Invalid choice! Try again.\n");
}
}
return 0;
}