Queue Program.
#include<iostream>
using namespace std;
void insert(int ele);
int delet();
void display();
#define MAX 5
int q[5];
int front=-1,rear=-1;
int main()
{
int ch,ele,ans;
while(1)
{
cout<<"\nPRESS 1 FOR INSERT";
cout<<"\nPRESS 2 FOR DELETE";
cout<<"\nPRESS 3 FOR DISPLAY";
cout<<"\nPRESS 4 FOR EXIT";
cout<<"\nENTER THE YOUR CHOICE: ";
cin>>ch;
switch(ch)
{
case 1:
cout<<"\nENTER THE ELEMENTS: ";
cin>>ele;
insert(ele);
break;
case 2:
ans=delet();
if(ans!=-1)
cout<<"\n"<<ans<<"IS DELETED";
break;
case 3:
display();
break;
case 4:
exit(0);
default:
cout<<"\nINVALID INPUT";
}
}
return 0;
}
void insert(int ele)
{
if(rear==MAX-1)
{
cout<<"\nQUEUE IS FULL";
}
else
{
if(front==-1)
{
front=front+1;
rear=rear+1;
}
else
{
rear=rear+1;
}
q[rear]=ele;
}
}
int delet()
{
int ans;
if(front==-1)
{
cout<<"\nQUEUE IS EMPTY";
return -1;
}
else
{
ans=q[front];
if(front==rear)
{
front=-1;
rear=-1;
}
else
{
front=front+1;
}
return ans;
}
}
void display()
{
int i;
if(front==-1)
{
cout<<"\nTHERE ARE NO ELEMENTS";
}
else
{
for(i=front;i<=rear;i++)
{
cout<<" "<<q[i];
}
}
}
0 Comments