-
Notifications
You must be signed in to change notification settings - Fork 0
/
que.cpp
157 lines (99 loc) · 1.16 KB
/
que.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
149
150
151
152
153
154
155
156
#include<iostream>
using namespace std;
class queqe1
{
public:
int size ;
int *que;
int front;
int rear;
queqe1( )
{ size = 5;
que = new int;
front = -1;
rear = -1;
}
void delet();
void display();
void insertEle(int );
};
void queqe1::insertEle(int no)
{
if(front== 0 && rear== (size-1))
{
cout<<"queqe is full";
}
else
if(front==(size-2)&& rear == (size-1) )
{
cout<<"queqe is full";
}
else
if(front== -1 )
{
que[++rear] = no;
++front;
}
else
{
que[++rear]= no;
}
}
void queqe1::delet()
{
if(front==-1&& rear==-1)
{
cout<<"list is empty";
}
else
if(front == rear)
{
front = -1;
rear = -1;
}
else
{
cout<<que[front];
++front;
}
}
void queqe1::display()
{
int i;
if(rear == -1 &&front ==-1)
{
cout<<"list is empty";
}
else
{
for(i=front;i<=rear;i++)
{
cout<<"values"<<que[i]<<endl;
}
}
}
int main()
{
queqe1 z;
int ch,ele;
while(1)
{
cout<<"1.insert"<<endl;
cout<<"2.delet"<<endl;
cout<<"3.display"<<endl;
cout<<"enter your choice";
cin>>ch;
switch(ch)
{
case 1 :{ cout<<"enter your ele";
cin>>ele;
z.insertEle(ele);
}
break;
case 2 : z.delet();
break;
case 3 : z.display();
break;
}
}
}