-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStack using array.c
More file actions
80 lines (76 loc) · 1.11 KB
/
Stack using array.c
File metadata and controls
80 lines (76 loc) · 1.11 KB
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
#include<stdio.h>
#include<stdlib.h>
#define MAX 4
void push(int);
int pop();
void display();
int A[MAX];
int top=-1;
main()
{
int ch,item;
while(1)
{
printf("\n1:PUSH\n2:POP\n3:Display\n0:Exit");
printf("\nEnter your choice ");
scanf("%d",&ch);
switch(ch)
{
case 1:printf("Enter a element ");
scanf("%d",&item);
push(item);
break;
case 2:printf("Delete item %d",pop());
break;
case 3:printf("\nSTACK\n");
display();
break;
case 0:exit(0);
default:printf("Wrong choice");
}
}
}
void push(int item)
{
if(top==MAX-1)
{
printf("Qverflow");
}
else
{
//printf("top=%d\n",top);
A[++top]=item;
//printf("top=%d",top);
}
}
int pop()
{
int x;
if(top==-1)
{
printf("\nStack is empty");
return -9999;
}
else
{
//printf("top=%d\n",top);
x=A[top--];
//printf("top=%d",top);
}
return x;
}
void display()
{
int i;
if(top<0)
{
printf("Empty!!!");
}
else
{
for(i=0;i<=top;i++)
{
printf("%d ",A[i]);
}
}
}