#include <iostream>
#define MAX 100
using namespace std;
char array[MAX];
int front=-1,rear=-1,count=0;
void enqueue(char data) ///enqueue element from this function
{
if(MAX==count) ///if the array is full
{
cout<<"Your Queue is Full"<<endl;
}
else
{
if(front==-1) ///for the 1st input
{
front++;
rear++;
}
else
{
rear = (rear+1)%MAX; /// increment rear by add 1 and then Mood the rear with Max
}
array[rear]=data; ///save data
count++;///increment count
}
}
char dequeue()
{
if(count==0) ///if the array is empty
{
cout<<"The Queue is Empty"<<endl<<endl;
return 0;
}
char t = array[front];
front = (front+1)%MAX; ///increment front value and mood the value by MAX
count--;///decrement count
return t;
}
void display()
{
int c,i;
if(count==0)///if the array is empty
{
cout<<"The Queue is Empty"<<endl<<endl;
return;
}
cout<<"Your Queue: ";
for(i=front,c=1; c<=count; i = (i+1)%MAX,c++) ///compare c with count and increase the i value and mood it by MAX
{
cout<<array[i]<<" ";
}
cout<<endl;
}
void menu()
{
int n;
while(1)
{
cout<<"Press 1 For EnqueuePress 2 For DequeuePress 3 For Display QueuePress 0 For Exit";
cin>>n;
if(n==1)
{
char data;
cout<<"Data: ";
cin>>data;
enqueue(data);
}
else if(n==2)
{
dequeue();
}
else if(n==3)
{
display();
}
else if(n==0)
{
return;
}
}
}
int main()
{
menu();
cout<<"N Value: "<<endl;
int n;
cin>>n;
while(n>0)
{
char t = dequeue();
enqueue(t);
n--;
}
display();
return 0;
}
Output
Press 1 For Enqueue
Press 2 For Dequeue
Press 3 For Display Queue
Press 0 For Exit
1
Data: 1
Press 1 For Enqueue
Press 2 For Dequeue
Press 3 For Display Queue
Press 0 For Exit
1
Data: 2
Press 1 For Enqueue
Press 2 For Dequeue
Press 3 For Display Queue
Press 0 For Exit
1
Data: 3
Press 1 For Enqueue
Press 2 For Dequeue
Press 3 For Display Queue
Press 0 For Exit
1
Data: 4
Press 1 For Enqueue
Press 2 For Dequeue
Press 3 For Display Queue
Press 0 For Exit
1
Data: 5
Press 1 For Enqueue
Press 2 For Dequeue
Press 3 For Display Queue
Press 0 For Exit
0
N Value:
2
Your Queue: 3 4 5 1 2
Add your comment