ds/multipleStack.c at master · Akshaylal/ds · GitHub

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
#include <stdio.h>
#define STACK_MAX 100

int s[STACK_MAX], TopA = -1, TopB = STACK_MAX;


/////Stack A
void pushA(int key){
	if((TopA + 1) == TopB){
		printf("Stack Overflow\n");
	}else{
		s[++TopA] = key;
	}
}

void popA(){
	if(TopA < 0){
		printf("Stack Underflow\n");
	}else{
		printf("%d\n", s[TopA--]);
	}
}

void statusA(){
	if((TopA + 1) == TopB){
		printf("Stack Full\n");
	}else if(TopA < 0){
		printf("Stack Empty\n");
	}else{
		printf("%d elements in Stack A\n", (TopA + 1));
	}
}

/////Stack B

void pushB(int key){
	if((TopB - 1) == TopA){
		printf("Stack Overflow\n");
	}else{
		s[--TopB] = key;
	}
}

void popB(){
	if(TopB == STACK_MAX){
		printf("Stack Underflow\n");
	}else{
		printf("%d\n", s[TopB++]);
	}
}

void statusB(){
	if((TopB - 1) == TopA){
		printf("Stack Full\n");
	}else if(TopB == STACK_MAX){
		printf("Stack Empty\n");
	}else{
		printf("%d elements in Stack B\n", (STACK_MAX - TopB));
	}
}
/////////////////////////////////////////////////
void main(){
	int opt, key;
	do{
		printf("1. PushA\n2. PopA\n3. StatusA\n4. PushA\n5. PopA\n6. StatusA\n0. Exit\n:");
		scanf("%d",&opt);
		switch(opt){
			case 1:
				printf("Enter element : ");
				scanf("%d", &key);
				pushA(key);
			break;
			case 2:popA();
			break;
			case 3:statusA();
			break;
			case 4:
				printf("Enter element : ");
				scanf("%d", &key);
				pushB(key);
			break;
			case 5:popB();
			break;
			case 6:statusB();
			break;
			case 0:;
			break;
			default:printf("Invalid choice\n");
		}
	}while(opt != 0);
}