-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q8.CPP
148 lines (125 loc) · 2.39 KB
/
Q8.CPP
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
139
140
141
142
143
144
145
146
147
148
// Queue - Using circular array
#include<iostream.h>
#include<conio.h>
template<class T> class queue
{
int rear, front;
int size;
int *arr;
public:
queue(int s)
{
front = rear = -1;
size = s;
arr = new int[s];
}
void enqueue(int value);
void dequeue();
void traversal();
};
template<class T>
void queue<T>::enqueue(int value)
{
if ((front == 0 && rear == size-1) ||
(rear == (front-1)%(size-1)))
{
cout<<"\nQueue is Full";
return;
}
else if (front == -1)
{
front = rear = 0;
arr[rear] = value;
}
else if (rear == size-1 && front != 0)
{
rear = 0;
arr[rear] = value;
}
else
{
rear++;
arr[rear] = value;
}
}
template <class T>
void queue<T>::dequeue()
{
if (front == -1)
{
cout<<"\nQueue is Empty";
return INT_MIN;
}
int data = arr[front];
arr[front] = -1;
if (front == rear)
{
front = -1;
rear = -1;
}
else if (front == size-1)
front = 0;
else
front++;
cout<<"\nDeleting: "<<data;
}
template <class T>
void queue<T>::traversal()
{
if (front == -1)
{
cout<<"\nQueue is Empty";
return;
}
cout<<"\nElements in Circular Queue are: ";
if (rear >= front)
{
for (int i = front; i <= rear; i++)
cout<<arr[i];
}
else
{
for (int i = front; i < size; i++)
cout<< arr[i];
for (int i = 0; i <= rear; i++)
cout<< arr[i];
}
}
void main()
{
clrscr();
int choice, x;
cout<<"\nEnter the max. size of the queue: ";
cin>>x;
list<int> que;
char ch;
here:
clrscr();
cout<<"\nMENU:- \n"
<<"\n1) Add"
<<"\n2) Delete"
<<"\n3) Display\n\n";
cin>>choice;
switch(choice)
{
case 1: clrscr();
cout<<"\nEnter data: ";
cin>>x;
que.enqueue(x);
break;
case 2: clrscr();
cout<<"\nEnter data: ";
cin>>x;
que.dequeue(x);
break;
case 3: clrscr();
que.traversal();
break;
default: "\nInvalid input!!";
}
cout<<"\n\nWanna try again??"
<<"\nHit 'Y', else any other key: ";
cin>>ch;
if(ch == 'y' || ch == 'Y')
goto here;
}