-
Notifications
You must be signed in to change notification settings - Fork 0
/
stack.c
90 lines (71 loc) · 1.36 KB
/
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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
#include <stdio.h>
#define MAX 5
struct stack
{
int array[MAX];
int top;
};
void init_stack(struct stack *s)
{
s->top = -1;
}
void push(struct stack *s, int item)
{
if(s->top == MAX-1)
{
printf("Stack is full. Couldn't push '%d' into stack\n", item);
return;
}
s->top++;
s->array[s->top] = item;
}
int *pop(struct stack *s)
{
int *data;
if(s->top == -1)
{
printf("Stack is empty\n");
return NULL;
}
data = &s->array[s->top];
s->top--;
return data;
}
int main(void)
{
struct stack s;
init_stack(&s);
push(&s, 11);
push(&s, 23);
push(&s, -8);
push(&s, 16);
push(&s, 27);
push(&s, 14);
push(&s, 20);
push(&s, 39);
push(&s, 2);
push(&s, 15);
push(&s, 7);
int *i = NULL;
i=pop(&s);
if(i) { printf("Item popped: %d\n", *i); }
i=pop(&s);
if(i) { printf("Item popped: %d\n", *i); }
i=pop(&s);
if(i) { printf("Item popped: %d\n", *i); }
i=pop(&s);
if(i) { printf("Item popped: %d\n", *i); }
i=pop(&s);
if(i) { printf("Item popped: %d\n", *i); }
i=pop(&s);
if(i) { printf("Item popped: %d\n", *i); }
i=pop(&s);
if(i) { printf("Item popped: %d\n", *i); }
i=pop(&s);
if(i) { printf("Item popped: %d\n", *i); }
i=pop(&s);
if(i) { printf("Item popped: %d\n", *i); }
i=pop(&s);
if(i) { printf("Item popped: %d\n", *i); }
return 0;
}