Write a Program in c that implement Queue and its operations ( insertion and deletion ) using arrays

/* Write a Program in c that implement Queue and its operations ( insertion and deletion ) using   arrays*/

 

#include <stdio.h>
#define MAX 50

void insert();

void delete();

void display();

int queue_array[MAX];

int rear = - 1;

int front = - 1;

main()

{

    int choice;

    while (1)

    {

        printf("\n 1.Insert element to queue \n");

        printf("\n 2.Delete element from queue \n");

        printf("\n 3.Display all elements of queue \n");

        printf("\n 4.Quit \n");

        printf("\n Enter your choice : \n");

        scanf("%d", &choice);

        switch (choice)

        {

            case 1:

            insert();

            break;

            case 2:

            delete();

            break;

            case 3:

            display();

            break;

            case 4:

            exit(1);

            default:

            printf("Wrong choice \n");

        } /* End of switch */

    } /* End of while */

} /* End of main() */



void insert()

{

    int add_item;

    if (rear == MAX - 1)

    printf("Queue Overflow \n");

    else

    {

        if (front == - 1)

        /*If queue is initially empty */

        front = 0;

        printf("\n Insert the element in queue : \n");

        scanf("%d", &add_item);

        rear = rear + 1;

        queue_array[rear] = add_item;

    }

} /* End of insert() */



void delete()

{

    if (front == - 1 || front > rear)

    {

        printf("Queue Underflow \n");

        return ;

    }

    else

    {

        printf("\n Element deleted from queue is : %d\n", queue_array[front]);

        front = front + 1;

    }

} /* End of delete() */



void display()

{

    int i;

    if (front == - 1)

        printf("\n Queue is empty \n");

    else

    {

        printf("\n Queue is : \n");

        for (i = front; i <= rear; i++)

            printf("%d ", queue_array[i]);

        printf("\n");

    }

}