completeDataStructureImplementation/completeQueueUsingArray.cpp at master · akhilagg7/completeDataStructureImplementation · 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
//implemented by: Akhil Aggarwal
//contact : akhilagg123@gmail.com

#include<iostream>
using namespace std;

class queue
{
	int *data;
	int nextIndex;
	int firstIndex;
	int size;
	int capacity;

	public:
		queue(int totalElement)
		{
			data=new int[totalElement];
			nextIndex=0;
			firstIndex=-1;
			size=0;
			capacity=totalElement;
		}

		int getSize()
		{
			return size;
		}

		bool isEmpty()
		{
			return size==0;
		}

		void push(int element)
		{
//			if(size==capacity)
//			{
//				cout<<"queue is full "<<endl;
//				return ;
//			}
			if(size==capacity)
			{
				int *newdata=new int[2*capacity];
				int j=0;
				for(int i=firstIndex;i<capacity;i++)
				{
					newdata[j]=data[i];
					j++;
				}
				for(int i=0;i<firstIndex;i++)
				{
					newdata[j]=data[i];
					j++;
				}
				delete [] data;
				data=newdata;
				firstIndex=0;
				nextIndex=capacity;
				capacity=2*capacity;
			}

			data[nextIndex]=element;
			nextIndex++;
			nextIndex=nextIndex%capacity;
			if(firstIndex==-1)
			{
				firstIndex=0;
			}
			size++;
		}

		int top()
		{
			if(size==0)
			{
				cout<<"queue is empty "<<endl;
				return 0;
			}
			return data[firstIndex];
		}

		int pop()
		{
			if(size==0)
			{
				cout<<"queue is empty "<<endl;
				return 0;
			}
			int ans=data[firstIndex];
			firstIndex++;
			firstIndex%=capacity;
			size--;
			return ans;
		}
};
int main()
{
	queue q(5);
	q.push(10);
	q.push(20);
	q.push(30);
	cout<<q.pop()<<endl;
	cout<<q.top()<<endl;
	q.push(40);
	cout<<q.pop()<<endl;
	q.push(50);
	q.push(60);
	q.push(70);
	q.push(80);
	q.push(90);
	cout<<q.top()<<endl;
	cout<<q.pop()<<endl;
	cout<<q.pop()<<endl;
	cout<<q.pop()<<endl;
	cout<<q.pop()<<endl;
	cout<<q.isEmpty()<<endl;
	cout<<q.getSize()<<endl;
}