Wednesday, 7 January 2015

Queue implementation

//Queue implementation.....
#include<iostream>
#include<cstdlib>
using namespace std;
void push(),pop(),treversal();
int size,front=-1,rear=-1,*queue;
int main()
{
int choise;
cout<<"Enter the size of Queue: "; cin>>size;
queue=(int*)malloc(size*sizeof(int));
do
{
cout<<"\n\n1-INSERT\n2-DELETE\n3-TREVERSAL\n4-EXIT\nENTER 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==-1 && rear==size-1)
{
char ch;
cout<<"Queue is full ! do you want increse the size of Queue: "; cin>>ch;
if(ch=='y')
{
size+=size;
queue=(int*)realloc(queue,size*sizeof(int));
cout<<"Queue has been resize,you can insert more item in queue !\n";
}
}
else
{
int item;
cout<<"Input item: "; cin>>item;
rear++;
queue[rear]=item;
cout<<"Item has been inserted !\n";
}
}
void pop()
{
if(front==rear)
{
if(front==-1&&rear==-1)
cout<<"Queue is empty !\n";
else
{
char ch;
cout<<"Queue has been Empty ! do you want reset to Queue y/n: "; cin>>ch;
if(ch=='y')
front=rear=-1;
}
}
else
{
front++;
queue[front]='\0';
cout<<"Front item has been deleted !\n";
}

}
void treversal()
{
if(front==rear)
cout<<"Queue is empty !\n";
else
{
for(int i=front+1;i<=rear;i++)
cout<<"|"<<queue[i]<<"|"<<" ";
}
}

No comments:

Post a Comment