1) Stack Using Array:-
=======================
#include <iostream>
using namespace std;
#define MAX 100
int stack[MAX];
int top = -1;
void push(int val){
if(top>=MAX-1){
cout <<"Stack is Overflow";
return;
}
top++;
stack[top] = val;
cout << val <<" pushed into stack";
cout <<endl;
}
int pop(){
if(top < 0){
cout <<"Stack is empty";
return -1;
}
int num=stack[top];
top--;
cout <<"\n"<< num <<" is poped from stack\n";
return num;
}
void display(){
if(top < 0){
cout <<"Stack is empty";
return;
}
cout <<"\nStack elements are:-\n";
for(int i=top; i>=0; i--){
cout << stack[i] << " ";
cout << endl;
}
}
int main() {
int ch, value;
while (true) { // Loop for continuous operation
cout <<"------------------------------";
cout << "\n1. Push\n";
cout << "2. Pop\n";
cout << "3. Display\n";
cout << "4. Exit\n";
cout <<"------------------------------\n";
cout << "Enter your choice: ";
cin >> ch;
cout <<"\n------------------------------";
switch (ch) {
case 1:
cout << "\nEnter the element to push: ";
cin >> value;
push(value);
break;
case 2:
pop();
break;
case 3:
display();
break;
case 4:
cout << "\nExiting...\n";
return 0;
default:
cout << "Invalid choice. Try again.\n";
}
}
return 0;
}
===================================================================================
=======================================================