-
Notifications
You must be signed in to change notification settings - Fork 0
/
dequeue.c
117 lines (110 loc) · 2.37 KB
/
dequeue.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
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
113
114
115
116
117
#include<stdio.h>
#define MAX 5
int dequeue[MAX], front = -1, rear = -1, i;
void insert_rear()
{
int n;
if(front == rear + 1 || front == 0 && rear == MAX - 1)
{
printf("\nQueue is full.\n");
return;
}
printf("Enter element to insert: ");
scanf("%d", &n);
if(front == -1)
front = 0;
rear = (rear + 1) % MAX;
dequeue[rear] = n;
}
void insert_front()
{
int n;
if(front == rear + 1 || front == 0 && rear == MAX - 1)
{
printf("\nQueue is full.\n");
return;
}
printf("Enter element to insert: ");
scanf("%d", &n);
if(front == -1)
{
front = rear = 0;
dequeue[front] = n;
}
else
{
if(front == 0)
front = MAX - 1;
else
front--;
dequeue[front] = n;
}
}
void delete_front()
{
if(front == -1)
{
printf("\nQueue is empty.\n");
return;
}
printf("Deleted element: %d\n", dequeue[front]);
if(front == rear)
front = rear = -1;
else
front = (front + 1) % MAX;
}
void delete_rear()
{
if(front == -1)
{
printf("\nQueue is empty.\n");
return;
}
printf("Deleted element: %d\n", dequeue[rear]);
if(front == rear)
front = rear = -1;
else
{
if(rear == 0)
rear = MAX - 1;
else
rear--;
}
}
void display()
{
if(front == -1)
{
printf("\nQueue is empty.\n");
return;
}
printf("\nDequeue: ");
for(i = front; i != rear; i = (i + 1) % MAX)
printf("%d\t", dequeue[i]);
printf("%d\t", dequeue[i]);
}
int main()
{
int ch;
do
{
printf("\n\t\t\t\tMENU\n");
printf("1. Insert from front\t2. Insert from rear\t3. Delete from front\n");
printf("4. Delete from rear\t5. Display\t\t6. Exit");
printf("\nEnter choice: ");
scanf("%d", &ch);
switch(ch)
{
case 1: insert_front();
break;
case 2: insert_rear();
break;
case 3: delete_front();
break;
case 4: delete_rear();
break;
case 5: display();
break;
}
}while(ch >= 1 && ch <= 5);
}