Wednesday, 7 January 2015

Circular Queue implementation

//C-Queue implementation
#include<iostream>
#include<cstdlib>
using namespace std;
void push(),pop(),treversal();
int size,front=-1,rear=-1,*cqueue;
int main()
{
cout<<"Enter the size of circular queue: "; cin>>size;
cqueue=(int*)malloc(size*sizeof(int));
do
{
int choise;
cout<<"\n1-INSERTION\n2-DELETE\n3-TREVERSAL\n4-EXIT\nENTER THE CHOISE: "; cin>>choise;
switch(choise)
{
case 1: push(); break;
case 2: pop(); break;
case 3: treversal(); break;
case 4: exit(0);
default: cout<<"Invalid choise !\n"; break;
}
}while(1);
return 0;
}
void push()
{
if((front==0 && rear==size-1) || (rear+1==front))
cout<<"Circular Queue is overflow !\n";
else
{
int item;
cout<<"Input item: "; cin>>item;
if(rear==size-1)
rear=0;
else
rear++;
cqueue[rear]=item;
if(front==-1)
front=0;
}
}
void pop()
{
if(front==-1)
cout<<"Circular queue is onderflow !\n";
else
{
int temp;
temp=cqueue[front];
if(front==rear)
front=rear=-1;
else
{
if(front==size-1)
front=0;
else
front++;
}
cout<<temp<<" deleted at index no "<<front-1<<"\n";
}
}
void treversal()
{
if(front==-1)
cout<<"Circular queue is Empty !\n";
else
{
int i;
cout<<"|";
if(rear<front)
{
for(i=front;i<size-1;i++)
cout<<cqueue[i]<<"|";
for(i=0;i<=rear;i++)
cout<<cqueue[i]<<"|";
}
else
for(i=front;i<=rear;i++)
cout<<cqueue[i]<<"|";
}
}

No comments:

Post a Comment