-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy patharray_stack.c
76 lines (59 loc) · 1.87 KB
/
array_stack.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
//Implements stack operations in a 1-D Array using Menu-Driven flow of control
//10.01.19
#include<stdio.h>
#include<stdbool.h>
#include<process.h>
main(){
int stackArray[25];
int topOfStack = -1;
int answer,i;
//For continuous display of the menu
while (true) {
printf("\n ************** \n");
printf("Stack Operations Using Array \n \n");
printf("1. Push \n");
printf("2. Pop \n");
printf("3. Display \n");
printf("4. Exit \n");
scanf("%d", &answer);
switch (answer){
//Entering values in stack
case 1:
if(topOfStack == 24){
printf("Stack is full, overflow \n");
}
else{
topOfStack++;
printf("Enter the value to be inserted \n");
scanf("%d", &stackArray[topOfStack]);
}
break;
case 2:
//Getting values from stack using LIFO
if(topOfStack == -1){
printf("Stack is empty, underflow \n");
}
else{
topOfStack--;
printf("Value is deleted \n");
}
break;
case 3:
//Display all values in stack
if(topOfStack == -1){
printf("Stack is empty add values first \n");
}
else{
printf("Stack is \n \n");
for(i = topOfStack;i >= 0;i--){
printf("%d \n", stackArray[i]);
}
}
break;
default:
exit(0);
}
}
}
//Written in ANSI for the GNU-GCC compiler
//Elit Altum