ds/stackArray.cpp at master · AunSyedShah/ds · 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
#include <iostream>
using namespace std;

class StackArray
{
private:
	int _current;
	int noOfElements;
	int _capacity;
	int *s;

public:
	StackArray(int capacity);
	bool isEmpty();
	bool isFull();
	void push(int value);
	void pop();
	int top();
};

StackArray::StackArray(int capacity)
{
	s = new int[capacity];
	_capacity = capacity;
	noOfElements = 0;
	_current = -1;
}
bool StackArray::isEmpty()
{
	if (_current == -1)
	{
		return true;
	}
	return false;
}

bool StackArray::isFull()
{
	if (_current == _capacity - 1)
	{
		return true;
	}
	return false;
}

void StackArray::push(int value)
{
	s[++_current] = value;
	noOfElements++;
}

void StackArray::pop()
{
	s[_current--];
	noOfElements--;
}
int StackArray::top()
{
	return s[_current];
}
void displayStack(StackArray s)
{
	while (!s.isEmpty())
	{
		cout << s.top() << endl;
		s.pop();
	}
}
int main(int argc, char const *argv[])
{

	return 0;
}