-
Notifications
You must be signed in to change notification settings - Fork 0
/
stackArray.cpp
98 lines (92 loc) · 1.75 KB
/
stackArray.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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
/*
Author: Mikias Berhanu
Date: Aug 29 2019
Desc: Simple Stack Implementation using array in C++
*/
//preprocessors
#include<iostream>
#include<conio.h>
#define MAX 5 // define a symbolic constant for the stack size
using namespace std;
// define class
class Stack{
int stack[MAX];
int top;
public:
Stack(){
top = -1;
}
void push();
void pop();
void display();
};
//push function
void Stack::push(){
int item;
// check for stack overflow
if(top == MAX - 1){
cout<<"----------------"<<endl;
cout<<"stack Overflow"<<endl;
cout<<"----------------"<<endl;
return;
}
cout<<"enter the number: ";
cin>>item;
top++;
stack[top] = item;
}
//pop function
void Stack::pop(){
int item;
// check for stack undeflow
if(top == -1){
cout<<"----------------"<<endl;
cout<<"stack Underflow"<<endl;
cout<<"----------------"<<endl;
return;
}
item = stack[top];
cout<<"----------------"<<endl;
cout<<item<<" is poped"<<endl;
cout<<"----------------"<<endl;
top--;
}
// display function
void Stack::display(){
// check if the stack is empty
if(top == -1){
cout<<"----------------"<<endl;
cout<<"stack is empty"<<endl;
cout<<"----------------"<<endl;
return;
}
cout<<"----------------"<<endl;
for(int i = top ; i >= 0 ; i--)
cout<<stack[i]<<endl;
cout<<"----------------"<<endl;
// cout<<endl;
}
// main function
int main(){
Stack stack;
int choice;
do{
cout<<"1. push"<<endl;
cout<<"2. pop"<<endl;
cout<<"3. display"<<endl;
cout<<"4. exit"<<endl;
cin>>choice;
switch(choice){
case 1: stack.push();
break;
case 2: stack.pop();
break;
case 3: stack.display();
break;
case 4: cout<<"terminating....."<<endl;
exit(0);
default: cout<<"Incorrect choice"<<endl;
}
}while(1);
return 0;
}