stack implementation
#include<stdio.h>
int stack[100],choice,n,top,x,i;
void push(void);
void pop(void);
void display(void);
int main()
{
//clrscr();
top=-1;
printf("n Enter the size of STACK[MAX=100]:");
scanf("%d",&n);
printf("nt STACK OPERATIONS USING ARRAY");
printf("nt--------------------------------");
printf("nt 1.PUSHnt 2.POPnt 3.DISPLAYnt 4.EXIT");
do
{
printf("n Enter the Choice:");
scanf("%d",&choice);
switch(choice)
{
case 1:
{
push();
break;
}
case 2:
{
pop();
break;
}
case 3:
{
display();
break;
}
case 4:
{
printf("nt EXIT POINT ");
break;
}
default:
{
printf ("nt Please Enter a Valid Choice(1/2/3/4)");
}
}
}
while(choice!=4);
return 0;
}
void push()
{
if(top>=n-1)
{
printf("ntSTACK is over flow");
}
else
{
printf(" Enter a value to be pushed:");
scanf("%d",&x);
top++;
stack[top]=x;
}
}
void pop()
{
if(top<=-1)
{
printf("nt Stack is under flow");
}
else
{
printf("nt The popped elements is %d",stack[top]);
top--;
}
}
void display()
{
if(top>=0)
{
printf("n The elements in STACK n");
for(i=top; i>=0; i--)
printf("n%d",stack[i]);
printf("n Press Next Choice");
}
else
{
printf("n The STACK is empty");
}
}