DSL/Assignment 10.cpp at master · ridh7/DSL · 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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
//============================================================================
// Name        : Assignment 10.cpp
// Author      : 21258
// Version     :
// Copyright   : Your copyright notice
// Description : Deque using circular array
//============================================================================

#include <iostream>
using namespace std;
class Dequeue
{
public:
	int b[5],front,rear;
	Dequeue()
	{
		front=-1;
		rear=0;
		for(int i=0;i<5;i++)
			b[i]=0;
	}
	bool isempty()
	{
		if(front==-1)
			return 1;
		else
			return 0;
	}
	bool isfull()
	{
		if((front==0 && rear==4)||front==rear+1)
			return 1;
		else
			return 0;
	}
	void addF(int a)
	{
		if(isfull())
	    {
	        cout<<"Dequeue is full"<<endl;
	    }
	    else
	    {
			if(front==-1)
		    {
		    	front=0;
		        rear=0;
		    }
		    else
				if(front==0)
			        front=4;
			    else
			        front=front-1;
		    b[front]=a;
		    cout<<"Number has been added to the front successfully!"<<endl;
		}
	}
	void addR(int a)
	{
		if(isfull())
	    {
			cout<<"Dequeue is full"<<endl;
	    }
	    else
	    {
			if(front==-1)
		    {
		        front=0;
		        rear=0;
		    }
		    else
				if(rear==4)
			        rear=0;
			    else
			        rear=rear+1;
		    b[rear]=a;
		    cout<<"Number has been added to the rear successfully!"<<endl;
		}
	}
	void delF()
	{
		if(isempty())
	    {
	        cout<<"Dequeue is empty"<<endl;
	    }
	    else
	    {
	    	b[front]=0;
			if(front==rear)
		    {
		        front=-1;
		        rear=-1;
		    }
		    else
		        if(front==4)
		            front=0;
		        else
		            front=front+1;
		    cout<<"Number has been deleted from the front successfully!"<<endl;
		}
	}
	void delR()
	{
		if (isempty())
	    {
	        cout<<"Dequeue is empty"<<endl;
	    }
	    else
	    {
	    	b[rear]=0;
			if (front==rear)
		    {
		        front=-1;
		        rear=-1;
		    }
		    else
				if(rear==0)
			        rear=4;
			    else
			        rear=rear-1;
			cout<<"Number has been deleted from the rear successfully!"<<endl;
	    }
	}
	void display()
	{
		for(int i=0;i<5;i++)
		{
			cout<<b[i]<<"\t";
		}
		cout<<endl;
	}
};

int main() {
	Dequeue q;
	int c,t;
	char e;
	do
	{
		cout<<"Enter your choice : \n1.Add from front\n2.Add from rear\n3.Delete from front\n4.Delete from rear\n5.Display\n";
		cin>>c;
		switch(c)
		{
		case 1:
			cout<<"Enter number: ";
			cin>>t;
			q.addF(t);
			break;
		case 2:
			cout<<"Enter number: ";
			cin>>t;
			q.addR(t);
			break;
		case 3:
			q.delF();
			break;
		case 4:
			q.delR();
			break;
		case 5:
			q.display();
			break;
		default:
			cout<<"Invalid Option"<<endl;
		}
		cout<<"Would you like to continue? (Y/N) ";
		cin>>e;
	}
	while(e=='Y'||e=='y');
	cout<<"Thank you!";
	return 0;
}