|
| 1 | +#include <stdio.h> |
| 2 | +#define SIZE 4 |
| 3 | + |
| 4 | +typedef struct { |
| 5 | + int container[SIZE]; |
| 6 | + int front; |
| 7 | + int rear; |
| 8 | +} queue; |
| 9 | + |
| 10 | +queue getNewQueue() { |
| 11 | + queue newQ; |
| 12 | + newQ.front = -1; |
| 13 | + newQ.rear = -1; |
| 14 | + |
| 15 | + return newQ; |
| 16 | +} |
| 17 | + |
| 18 | +int isEmpty(queue* Q) { |
| 19 | + if (Q->front == -1) { |
| 20 | + return 1; |
| 21 | + } |
| 22 | + else { |
| 23 | + return 0; |
| 24 | + } |
| 25 | +} |
| 26 | + |
| 27 | +int isFull(queue* Q) { |
| 28 | + return (Q->rear + 1) % SIZE == Q->front; |
| 29 | +} |
| 30 | + |
| 31 | +void enqueue(queue* Q, int value) { |
| 32 | + if (isFull(Q)) { |
| 33 | + printf("[This Queue is full] "); |
| 34 | + return; |
| 35 | + } |
| 36 | + else if (Q->front == -1) { |
| 37 | + Q->front = 0; |
| 38 | + Q->rear = 0; |
| 39 | + Q->container[Q->rear] = value; |
| 40 | + } |
| 41 | + else { |
| 42 | + Q->rear = (Q->rear + 1) % SIZE; |
| 43 | + Q->container[Q->rear] = value; |
| 44 | + } |
| 45 | +} |
| 46 | + |
| 47 | +int dequeue(queue* Q) { |
| 48 | + if (isEmpty(Q)) { |
| 49 | + printf("[This Queue is empty, Return value should be ignored] "); |
| 50 | + return -1; |
| 51 | + } |
| 52 | + // Only one element left |
| 53 | + else if (Q->front == Q->rear) { |
| 54 | + int temp = Q->container[Q->front]; |
| 55 | + Q->front = -1; |
| 56 | + Q->rear = -1; |
| 57 | + return temp; |
| 58 | + } |
| 59 | + int temp = Q->container[Q->front]; |
| 60 | + Q->front = (Q->front + 1) % SIZE; |
| 61 | + return temp; |
| 62 | +} |
| 63 | + |
| 64 | +int main(void) { |
| 65 | + queue q1 = getNewQueue(); |
| 66 | + |
| 67 | + for (int i = 0; i < 4; i++) { |
| 68 | + enqueue(&q1, i); |
| 69 | + printf("Enqueue : %d\n", i); |
| 70 | + } |
| 71 | + |
| 72 | + for (int i = 0; i < 3; i++) { |
| 73 | + printf("Dequeue : %d\n", dequeue(&q1)); |
| 74 | + } |
| 75 | + |
| 76 | + for (int i = 0; i < 4; i++) { |
| 77 | + enqueue(&q1, i); |
| 78 | + printf("Enqueue : %d\n", i); |
| 79 | + } |
| 80 | + |
| 81 | + for (int i = 0; i < 5; i++) { |
| 82 | + printf("Dequeue : %d\n", dequeue(&q1)); |
| 83 | + } |
| 84 | + |
| 85 | + return 0; |
| 86 | +} |
0 commit comments