DSA/stack using array.cpp at master · akshitalodha/DSA · 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
#include<iostream>
#include<conio.h>
#include<stdlib.h>
using namespace std;
int stack[10];
int top=-1;
void push(int);
int pop();
void display();
int main()
{
 int ch,item;
 while(1)
 {
 cout<<"1.push , 2.pop ,3.display , 4.exit "<<endl;
 cout<<"enter your choice"<<endl;
 cin>>ch;
 switch(ch)
 {
  case 1:
  	cout<<"enter the item "<<endl;
  	cin>>item;
  	push(item);
  	break;
  case 2:
  	cout<<"popped item is"<<pop()<<endl;
  	break;
  case 3:
  	display();
  	break;
  case 4:
    exit(0);
   break;
   default :
   	cout<<"please enter valid choice"<<endl;
 }
 }
  getch();
  return 0;
}
void push(int item)
{
 if(top==10)
 {
  cout<<"stack overflow "<<endl;
 }
 else
 {
 	top++;
 	stack[top]=item;
 	cout<<"element is entered "<<endl;
 }
}
int pop()
{
 int x;
  if(top<0)
  {
   cout<<"stack underflow" <<endl;
   return 0;
  }
  else
  {
  	x=stack[top];
  	top--;
  	return x;
  }
}
void display()
{
 int i;
 cout<<"stack is"<<endl;
 for(i=top;i>=0;i--)
 cout<<stack[i]<<endl;
}