-
Notifications
You must be signed in to change notification settings - Fork 1
/
2stackwith1array.c
95 lines (78 loc) · 1.32 KB
/
2stackwith1array.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
//*******************************************************************************/
gfg problem....
implementing 2 stack with single array
_________________________________________________________________________________________
#include <stdio.h>
#define n 100
//int stack[MAX];
int top1 =-1;
int top2 =n;
void push1(int arr[],int item)
{
if(top1+1 == top2 )
{
printf("overflow");
}
else
{
top1 = top1+1;
arr[top1]= item;
printf("now top of the element is %d\n",arr[top1]);
}
}
int pop1(int arr[])
{
int temp;
if(top1 ==-1)
{
printf("underflow");
return -1;
}
else
{
temp = arr[top1];
top1 = top1-1;
printf("%d\n",temp);
}
return temp;
}
void push2(int arr[],int item)
{
if(top1+1 == top2)
{
printf("overflow");
}
else
{
top2 = top2-1;
arr[top2]= item;
printf("now top of the element is %d\n",arr[top2]);
}
}
int pop2(int arr[])
{
int temp;
if(top2 ==n)
{
printf("underflow");
return -1;
}
else
{
temp = arr[top2];
top2 = top2+1;
printf("%d\n",temp);
}
return temp;
}
int main()
{
int stack[n];
int top = -1;
push1(stack,2);
push1(stack,3);
push2(stack,4);
pop1(stack);
pop2(stack);
return 0;
}