Loading...
Searching...
No Matches
circular_queue_using_array.cpp
1#include <iostream> 2usingstd::cin;
3usingstd::cout;
4 5int queue[10];
6intfront = 0;
7intrear = 0;
8intcount = 0;
9 10voidEnque(
intx) {
11 if(count == 10) {
12cout <<
"\nOverflow";
13}
else{
14 queue[rear] = x;
15rear = (rear + 1) % 10;
16count++;
17}
18}
19 20voidDeque() {
21 if(front == rear) {
22cout <<
"\nUnderflow";
23}
24 25 else{
26cout <<
"\n"<<
queue[front] <<
" deleted";
27front = (front + 1) % 10;
28count--;
29}
30}
31 32voidshow() {
33 for(
inti = 0; i < count; i++) {
34cout <<
queue[(i + front) % 10] <<
"\t";
35}
36}
37 38int main() {
39 intch, x;
40 do{
41cout <<
"\n1. Enque";
42cout <<
"\n2. Deque";
43cout <<
"\n3. Print";
44cout <<
"\nEnter Your Choice : ";
45cin >> ch;
46 if(ch == 1) {
47cout <<
"\nInsert : ";
48cin >> x;
49Enque(x);
50}
else if(ch == 2) {
51Deque();
52}
else if(ch == 3) {
53show();
54}
55}
while(ch != 0);
56 57 return0;
58}
queue Definition queue.hpp:9 mainint main()
Main function.
Definition generate_parentheses.cpp:110RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4