Friday, October 19, 2007

2.queue using array

//queue using array
#include<iostream.h>
#include<conio.h>
#include<process.h>
template <class t>
class queue
{
int f,r,temp;
int a[10];
public:
queue() {f=0;r=-1;}
void insert(t &ele)
{
cout<<"\ninsert an element";
cin>>ele;
r++;
a[r]=ele;
}
t deletion()
{
temp=a[f];
f++;
return(temp);
}
void display()
{
if(f>r)
{cout<<"queue is empty"; return; }
cout<<"the elements are";
for(int i=f;i<=r;i++)
cout<<a[i]<<"\n";
}
};
void main()
{
queue <int> q;
clrscr();
int choice; char n;
while(1)
{
cout<<"1.insert\n2.delete\n3.display\n4.exit\n";
cout<<"\nenter ur choice";
cin>>choice;
switch(choice)
{
case 1:q.insert(n);
break;
case 2:q.deletion();
break;
case 3:q.display();
break;
case 4:exit(1);
}
}
getch();
}

No comments: