-
-
Notifications
You must be signed in to change notification settings - Fork 4.4k
/
main.c
117 lines (110 loc) · 2.04 KB
/
main.c
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
// program for stack using array
#include <stdio.h>
void push();
void pop();
void peek();
void update();
void display();
int a[100], top = -1;
int main()
{
int x;
while (1)
{
printf("\n0 or CTRL-C to Exit ");
printf("\n1. Push");
printf("\n2. Pop");
printf("\n3. Peek");
printf("\n4. Update");
printf("\n5. Display");
printf("\nEnter your choice? \n");
scanf("%d", &x);
switch (x)
{
case 0:
return 0;
case 1:
push();
break;
case 2:
pop();
break;
case 3:
peek();
break;
case 4:
update();
break;
case 5:
display();
break;
default:
printf("\nInvalid choice,\nPlease try again.\n");
}
}
return (0);
}
// function for pushing the element
void push()
{
int n = 0;
printf("\nEnter the value to be inserted: ");
scanf("%d", &n);
top += 1;
a[top] = n;
}
// function for poping the element out
void pop()
{
if (top == -1)
{
printf("\nStack is empty");
}
else
{
int item;
item = a[top];
top -= 1;
printf("\nPoped item is %d ", item);
}
}
// function for peeping the element from top of the stack
void peek()
{
if (top >= 0)
printf("\nThe top element is %d", a[top]);
else
printf("\nStack is empty");
}
// function to update the element of stack
void update()
{
int i, n;
printf("\nEnter the position to update? ");
scanf("%d", &i);
printf("\nEnter the item to insert? ");
scanf("%d", &n);
if (top - i + 1 < 0)
{
printf("\nUnderflow condition ");
}
else
{
a[top - i + 1] = n;
}
}
// function to view entire stack
void display()
{
if (top == -1)
{
printf("\nStack is empty");
}
else
{
for (int i = top; i >= 0; i--)
{
printf("%d\n", a[i]);
}
}
}