-
Notifications
You must be signed in to change notification settings - Fork 2
/
Prg 7.cpp
125 lines (100 loc) · 2.02 KB
/
Prg 7.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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
/**
Lab Program 7
Operator Overloading - Stack Class
Author SkyKOG
*/
#include <iostream>
#include <conio.h>
#include <process.h>
#include <windows.h>
#define MAX 5
using namespace std;
class STACK {
int top;
int arr[MAX];
public:
STACK();
STACK operator + (int);
STACK operator -- ();
friend void operator <<(ostream &,STACK &);
};
void main()
{
STACK s1;
int ch,ele;
while(true)
{
system("cls");
cout<<"1. Push\n2. Pop\n3. Display\n4. Exit\n\nEnter Your Choice : ";
cin>>ch;
switch(ch)
{
case 1:cout<<"\nEnter The Element to Push : ";
cin>>ele;
s1 = s1 + ele;
cout<<"\n"<<s1;
break;
case 2:s1 = --s1;
cout<<"\n"<<s1;
break;
case 3:cout<<"\n"<<s1;
break;
case 4:exit(0);
break;
default:cout<<"\nInvalid Selection\n";
}
getch();
}
}
STACK::STACK()
{
top=-1;
}
STACK STACK::operator +(int ele)
{
if(top==MAX-1)
{
cout<<"\nSTACK Overflow";
return *this;
}
arr[++top]=ele;
return *this;
}
STACK STACK::operator --()
{
if(top==-1)
{
cout<<"\nSTACK Underflow\n";
return *this;
}
cout<<"\nThe Popped Element is : "<<arr[top--]<<"\n";
return *this;
}
void operator <<(ostream &out,STACK &s)
{
if(s.top==-1)
{
out<<"\nSTACK Empty";
return;
}
cout<<"\nThe Current Contents of STACK Are : ";
for(int i = s.top ; i >= 0 ; i--)
{
out<<s.arr[i]<<" ";
}
}
/*
License
=======
Copyright © 2011 SkyKOG
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/