-
Notifications
You must be signed in to change notification settings - Fork 0
/
bankers_queue.c
95 lines (75 loc) · 2.26 KB
/
bankers_queue.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
#include <stdio.h>
#include <stdlib.h>
#define MAX_SIZE 10
// Structure to represent a stack
struct Stack {
int arr[MAX_SIZE];
int top;
};
// Function to initialize a stack
void initStack(struct Stack* stack) {
stack->top = -1;
}
// Function to check if the stack is empty
int isEmpty(struct Stack* stack) {
return (stack->top == -1);
}
// Function to check if the stack is full
int isFull(struct Stack* stack) {
return (stack->top == MAX_SIZE - 1);
}
// Function to push an element onto the stack
void push(struct Stack* stack, int value) {
if (isFull(stack)) {
printf("Stack is full. Cannot push.\n");
return;
}
stack->arr[++(stack->top)] = value;
}
// Function to pop an element from the stack
int pop(struct Stack* stack) {
if (isEmpty(stack)) {
printf("Stack is empty. Cannot pop.\n");
return -1;
}
return stack->arr[(stack->top)--];
}
// Structure to represent a Banker's Queue using two stacks
struct BankersQueue {
struct Stack stack1; // Rear stack for enqueue
struct Stack stack2; // Front stack for dequeue
};
// Function to enqueue an element into the Banker's Queue
void enqueue(struct BankersQueue* queue, int value) {
if (isFull(&(queue->stack1)) || isFull(&(queue->stack2))) {
printf("Queue is full. Cannot enqueue.\n");
return;
}
while (!(isEmpty(&(queue->stack2)))) {
push(&(queue->stack1), pop(&(queue->stack2)));
}
push(&(queue->stack1), value);
}
// Function to dequeue an element from the Banker's Queue
int dequeue(struct BankersQueue* queue) {
if (isEmpty(&(queue->stack1)) && isEmpty(&(queue->stack2))) {
printf("Queue is empty. Cannot dequeue.\n");
return -1;
}
while (!(isEmpty(&(queue->stack1)))) {
push(&(queue->stack2), pop(&(queue->stack1)));
}
return pop(&(queue->stack2));
}
int main() {
struct BankersQueue queue;
initStack(&(queue.stack1));
initStack(&(queue.stack2));
enqueue(&queue, 1);
enqueue(&queue, 2);
enqueue(&queue, 3);
printf("Dequeued element: %d\n", dequeue(&queue)); // Output: Dequeued element: 1
enqueue(&queue, 4);
printf("Dequeued element: %d\n", dequeue(&queue)); // Output: Dequeued element: 2
return 0;
}