ds-lab/circularqueue.cpp at master · Sahaj21/ds-lab · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include<iostream>
using namespace std;


int a[5],f=-1,r=-1;


  int display()

  {if(r>=0 && f>=0)
  {

  int i=f;
  if(r==f)
  {
  cout<<a[f];
  }
  else
  {
  do
  {cout<<a[i];
  i=(++i)%5;

  }while(i!=r);
  cout<<a[i];
  }
  }

  }

void enqueue()
   {
   int item;
   if((r==4 && f==0)||r+1==f)
   {
   cout<<"Queue is Full!!\n";

   }
   else if(f==-1 && r==-1)
   {f++;r++;
   cout<<"Enter the element:";
   cin>>item;
   a[r]=item;
   }
   else
   {
   r=(++r)%5;
   cout<<"Enter the element:";
   cin>>item;
   a[r]=item;
   }
   }


    void dequeue()
   {
   	if(f==-1 && r==-1)
   	cout<<"Queue is Empty!!";
   	else if(r==f)
   	{
   	cout<<"Element popped out is:"<<a[f]<<"\n";
	r=-1;f=-1;
	}
	else
	{
	cout<<"Element popped out is:"<<a[f]<<"\n";
	f=(++f)%5;
    }
   }


int main()
{ int c;
  cout<<"\n1.Enqueue\n2.Dequeue\n0.End\n";
  cin>>c;

  while(c!=0)
  {

  switch(c)
  {
  	case 1:enqueue();display();cout<<"\n";break;
   	case 2:dequeue();display();cout<<"\n";break;
  	default :break;
  }
cout<<"\n1.Enqueue\n2.Dequeue\n0.End\n";
cin>>c;

  }
}