-
Notifications
You must be signed in to change notification settings - Fork 12
/
Copy pathStack.cpp
83 lines (74 loc) · 1.41 KB
/
Stack.cpp
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
#include<iostream>
using namespace std;
#define X 4
int top = -1, inp_array[X];
void push();
void pop();
void show();
int main()
{
int choice;
while (1)
{
printf("\nPerform operations on the stack:");
printf("\n1.Push the element\n2.Pop the element\n3.Show\n4.End");
printf("\n\nEnter the choice: ");
scanf("%d", &choice);
switch (choice)
{
case 1:
push();
break;
case 2:
pop();
break;
case 3:
show();
break;
case 4:
exit(0);
default:
printf("\nInvalid choice!!");
}
}
}
void push()
{
int a;
if (top == X - 1)
{
cout<<endl<<"Overflow";
}
else
{
cout<<endl<<"Enter the element to be added onto the stack:";
cin>>a;
top = top + 1;
inp_array[top] = a;
}
}
void pop()
{
if (top == -1)
{
cout<<endl<<"Underflow";
}
else
{
cout<<endl<<"Popped element "<<inp_array[top];
top = top - 1;
}
}
void show()
{
if (top == -1)
{
cout<<endl<<"Underflow!!";
}
else
{
cout<<endl<<"Elements present in the stack: "<<endl;
for (int i = top; i >= 0; --i)
cout<<inp_array[i]<<endl;
}
}