-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathStack-using-Array.c
More file actions
66 lines (56 loc) · 1.37 KB
/
Stack-using-Array.c
File metadata and controls
66 lines (56 loc) · 1.37 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
// C program to implement Stack using array //
// Written by: @ExpressHermes
#include <stdio.h>
#include <stdlib.h>
#define SIZE 100
int stack[SIZE];
int top = -1;
void push(int value) {
if(top == SIZE -1)
printf("\nOverflow. Stack is full\n");
else {
top++;
stack[top] = value;
printf("\nInsertion was successful\n");
}
}
void pop() {
if(top == -1)
printf("\nUnderflow. Stack is empty\n");
else {
printf("\nPopped Value: %d\n", stack[top]);
top--;
}
}
void display() {
if(top == -1)
printf("\nStack is empty \n");
else {
printf("Stack elements are: ");
for(int i = top; i >= 0; i--)
printf("%d\t", stack[i]);
printf("\n");
}
}
int main(void) {
int choice, value;
printf("\n************* STACK IMPLEMENTATION USING STRUCURES *************\n");
while(1) {
printf("1. Push\n2. Pop\n3. Display\n4. Exit\n");
printf("Enter your choice: ");
scanf("%d",&choice);
switch(choice) {
case 1: printf("Enter value to be pushed: ");
scanf("%d", &value);
push(value);
break;
case 2: pop();
break;
case 3: display();
break;
case 4: exit(0);
default: printf("\nWrong choice. Try again.\n");
}
}
return 0;
}