Program for implementing Simple Queue Program using functions.

#include<stdio.h>
#include<conio.h>
#include<stdlib.h>

#define MAX_SIZE 100

int item, choice, i;
int arr_queue[MAX_SIZE];
int rear = 0;
int front = 0;
int exit_p = 1;

void insert() {
    if (rear == MAX_SIZE)
        printf("\n## Queue Reached Max!");
    else {
        printf("\nEnter The Value to be Insert : ");
        scanf("%d", &item);
        printf("\n## Position : %d , Insert Value  : %d ", rear + 1, item);
        arr_queue[rear++] = item;
    }
}

void removeData() {
    if (front == rear)
        printf("\n## Queue is Empty!");
    else {
        printf("\n## Position : %d , Remove Value  : %d ", front, arr_queue[front]);
        front++;
    }
}

void display() {
    printf("\n## Queue Size : %d ", rear);
    for (i = front; i < rear; i++)
        printf("\n## Position : %d , Value  : %d ", i, arr_queue[i]);
}

int main() {
    printf("\nSimple Queue Example - Array and Functions");
    do {
        printf("\n\n Queue Main Menu");

        printf("\n1.Insert \n2.Remove \n3.Display \nOthers to exit");
        printf("\nEnter Your Choice : ");
        scanf("%d", &choice);
        switch (choice) {
            case 1:
                insert();
                break;
            case 2:
                removeData();
                break;
            case 3:
                display();
                break;
            default:
                exit_p = 0;
                break;
        }
    } while (exit_p);

    return 0;
}