#include <stdio.h>
#include <stdlib.h>
void insert(int);
void dele();
void display();
int s[20], item, i, n = 10;
int top = -1;
int main(void)
{
while(1){
printf("Array implementation of a stack\n");
printf("1, Insertion \n");
printf("2, Deletion \n");
printf("3, Display \n");
printf("Enter your choice [1..4]");
scanf("%d", &i);
switch(i){
case 1:
printf("Insertion \n");
printf("Enter item\n");
scanf("%d", &item);
insert(item);
break;
case 2:
printf("Delletion\n");
dele();
break;
case 3:
display();
break;
case 4:
exit (1);
break;
default:
exit(-1);
}
}
}
void insert(int item)
{
if (top > n)
printf("Stack is full");
top = top + 1;
s[top] = item;
return ;
}
void dele()
{
if (top < 0){
printf("stack is empty\n");
return ;
}
item = s[top--];
printf("Deleted item is %d", item);
printf("\n");
}
void display()
{
int i = 0;
printf("Content of this stack is :");
while (i <= top){
printf("%d ", s[i]);
i++;
}
printf("\n");
return ;
}
#include <stdlib.h>
void insert(int);
void dele();
void display();
int s[20], item, i, n = 10;
int top = -1;
int main(void)
{
while(1){
printf("Array implementation of a stack\n");
printf("1, Insertion \n");
printf("2, Deletion \n");
printf("3, Display \n");
printf("Enter your choice [1..4]");
scanf("%d", &i);
switch(i){
case 1:
printf("Insertion \n");
printf("Enter item\n");
scanf("%d", &item);
insert(item);
break;
case 2:
printf("Delletion\n");
dele();
break;
case 3:
display();
break;
case 4:
exit (1);
break;
default:
exit(-1);
}
}
}
void insert(int item)
{
if (top > n)
printf("Stack is full");
top = top + 1;
s[top] = item;
return ;
}
void dele()
{
if (top < 0){
printf("stack is empty\n");
return ;
}
item = s[top--];
printf("Deleted item is %d", item);
printf("\n");
}
void display()
{
int i = 0;
printf("Content of this stack is :");
while (i <= top){
printf("%d ", s[i]);
i++;
}
printf("\n");
return ;
}