stack_using_array.cpp

#include<iostream>
using namespace std;

int stack[100001];
int top=0;

void push(int x)
{
	if(top==100001)
	{
		cout<<"\nOverflow";
	}
	else
	{
		stack[top++]=x;
	}
}

void pop()
{
	if (top==0)
	{
		cout<<"\nUnderflow";
	}
	else
	{
		cout<<"\n"<<stack[--top]<<" deleted";
	}
}

void show()
{
	for (int i = 0; i < top; i++)
	{
		cout<<stack[i]<<"\n";
	}
}

void topmost()
{
    cout << "\nTopmost element: "<<stack[top-1];
}
int main()
{
	int ch, x;
	do
	{
		cout<<"\n1. Push";
		cout<<"\n2. Pop";
		cout<<"\n3. Print";
         	cout<<"\n4. Print topmost element:";
		cout<<"\n5. Quit:";
       		cout<<"\nEnter Your Choice : ";
		cin>>ch;
		if (ch==1)
		{
			cout<<"\nInsert : ";
			cin>>x;
			push(x);
		}
		else if (ch==2)
		{
			pop();
		}
		else if (ch==3)
		{
			show();
		}
       		 else if(ch==4)
		{
		       topmost();
		}
		else if(ch==5)
		{
		 	break;
		}
	}while(ch!=0);

	return 0;
}