-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathqueue.c
More file actions
84 lines (68 loc) · 1.27 KB
/
queue.c
File metadata and controls
84 lines (68 loc) · 1.27 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
#include<stdio.h>
#include<stdlib.h>
#define MAX 50
int queue[MAX], front = -1, rear = -1;
void enqueue() {
int elem;
if (rear == MAX - 1) {
printf("Queue Overflow! Cannot enqueue more elements.\n");
return;
}
printf("Enter the element to be enqueued: ");
scanf("%d", &elem);
if (front == -1) {
front = 0;
}
rear++;
queue[rear] = elem;
printf("%d enqueued to the queue.\n", elem);
}
void dequeue() {
if (front == -1 || front > rear) {
printf("Queue Underflow! No elements to dequeue.\n");
return;
}
printf("Dequeued element: %d\n", queue[front]);
front++;
if (front > rear) {
front = rear = -1;
}
}
void display() {
int i;
if (front == -1) {
printf("Queue is empty.\n");
return;
}
printf("Queue elements are:\n");
for (i = front; i <= rear; i++) {
printf("%d ", queue[i]);
}
printf("\n");
}
int main()
{
int ch;
while(1)
{
printf("\n---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",&ch);
switch(ch)
{
case 1: enqueue();
break;
case 2: dequeue();
break;
case 3: display();
break;
case 4: exit(0);
default: printf("Invalid entry make a correct entry between 1-4");
}
}
return 0;
}