C Exercises: Find the median of the elements in a queue

#include <stdio.h>
#define MAX_SIZE 100 // Define the maximum size of the queue

int queue[MAX_SIZE]; // Array to store elements of the queue
int front = -1, back = -1; // Initialize front and back pointers

// Function to insert an element into the queue
void enqueue(int item) {
    if (back == MAX_SIZE - 1) { // Check if the queue is full
        printf("Error: Queue is full\n"); // Print error message if the queue is full
        return;
    }
    if (front == -1) { // Check if the queue is empty
        front = 0; // If empty, set front to 0
    }
    back++; // Increment the back pointer
    queue[back] = item; // Add the item to the queue
}

// Function to remove an element from a queue
int dequeue() {
    if (front == -1 || front > back) { // Check if the queue is empty
        printf("Error: Queue is empty\n"); // Print error message if the queue is empty
        return -1; // Return -1 to indicate an empty queue
    }
    int item = queue[front]; // Get the front element of the queue
    front++; // Move the front pointer to the next element
    return item; // Return the removed element
}

// Function to find the median of the elements in the queue
float find_median() {
    // First, make a copy of the queue
    int n = back - front + 1; // Calculate the number of elements in the queue
    int temp[n]; // Create a temporary array to store the elements
    for (int i = 0; i < n; i++) { // Copy elements from the queue to the temporary array
        temp[i] = queue[front + i];
    }
    // Then, sort the copy in ascending order using bubble sort algorithm
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            if (temp[j] < temp[i]) { // Swap elements if out of order
                int t = temp[i];
                temp[i] = temp[j];
                temp[j] = t;
            }
        }
    }
    // Calculate the median based on the sorted copy
    if (n % 2 == 0) { // If the number of elements is even
        int m1 = temp[n/2 - 1]; // Get the two middle elements
        int m2 = temp[n/2];
        return (float)(m1 + m2) / 2; // Calculate and return the average of the two middle elements
    } else { // If the number of elements is odd
        int m = temp[n/2]; // Get the middle element
        return (float)m; // Return the middle element as the median
    }
}

// Function to display the elements in the queue
void display_elements() {
    for (int i = front; i <= back; i++) { // Loop through the elements of the queue
        printf("%d ", queue[i]); // Print the current element
    }
    printf("\n"); // Print a newline after displaying all elements
}

int main() {
    // Insert some elements into the queue.
    printf("Input some elements into a queue:\n");
    enqueue(1);
    enqueue(2);
    enqueue(3);
    enqueue(4);
    enqueue(5);
    printf("Queue elements are:\n");
    display_elements();
    // Find the median of the elements in the queue.
    float median = find_median();
    printf("The median of the elements in the queue is %f\n", median);
    printf("\nInput one more element:");
    enqueue(6);
    printf("\nQueue elements are:\n");
    display_elements();
    // Find the median of the elements in the queue.
    median = find_median();
    printf("The median of the elements in the queue is %f\n", median);    
    return 0;
}