-
Notifications
You must be signed in to change notification settings - Fork 0
/
Deque.c
138 lines (135 loc) · 2.13 KB
/
Deque.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
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
#include <stdio.h>
int front = -1;
int rear = -1;
int size = 0;
void EnqueueFront(int ans, int deque[], int n)
{
if (size == n)
{
printf("Queue is full");
return;
}
if (front == -1 && rear == -1)
{
front = 0;
rear = 0;
}
if (front == 0)
{
front = n - 1;
}
else
front--;
deque[front] = ans;
size++;
}
void EnqueueRear(int ans, int deque[], int n)
{
if (size == n)
{
printf("Queue is full");
return;
}
if (front == -1 && rear == -1)
{
front = 0;
rear = 0;
}
if (rear == n - 1)
{
rear = 0;
}
else
rear++;
deque[rear] = ans;
size++;
}
void DequeueFront( int deque[], int n)
{
if (front == -1 && rear == -1)
{
printf("Queue is Empty");
return;
}
if (front == rear)
{
front = -1;
rear = -1;
return;
}
if (front == n - 1)
{
front = 0;
}
else front++;
size--;
}
void DequeueRear( int deque[], int n)
{
if (front == -1 && rear == -1)
{
printf("Queue is Empty");
return;
}
if (front == rear)
{
front = -1;
rear = -1;
return;
}
if (rear == 0)
{
rear = n - 1;
}
else rear--;
size--;
}
void Display(int deque[], int n)
{
printf("Deque: ");
int count = size;
int i = front;
while (count--)
{
printf("%d ", deque[i]);
i = (i + 1) % n;
}
}
void main()
{
int inp, ans, deque[50], n;
printf("Enter the size of the deque: ");
scanf("%d", &n);
while(1)
{
printf("\nEnter 1 for Enqueue at front\n2 for Dequeue at front\n3 for Enqueue at rear\n4 for Dequeue at rear\n5 to exit\n");
scanf("%d", &inp);
switch (inp)
{
case 1:
printf("\nEnter the element: ");
scanf("%d", &ans);
EnqueueFront(ans, deque, n);
Display(deque,n);
break;
case 2:
DequeueFront( deque, n);
Display(deque,n);
break;
case 3:
printf("\nEnter the element: ");
scanf("%d", &ans);
EnqueueRear(ans, deque, n);
Display(deque,n);
break;
case 4:
DequeueRear( deque, n);
Display(deque,n);
break;
case 5:
return;
default:
printf("Invalid input");
break;
}}
}