sem 2 queue lab 2

#include<stdio.h>
#define size 5
int front=-1;
int rear=-1;
void insertq(int queue[],int item)
{
    if((front==0&&rear==size-1)||front==rear+1)
    {
        printf("queue is full\n");
        return ;
    }
    else if(rear==-1)
    {
        rear++;
        front++;
    }
    else if(rear==size-1&&front>0)
    {
        rear=0;
    }
    else
    {
        rear++;
    }

    queue[rear]=item;
}
void showfront(int queue[])
{
    if(front==-1&&rear==-1)
    {
        printf("queue is empty\n");
        return;
    }
    else
    {

        printf("%d\n",queue[front])
        ;
    }
}
void deleteq(int queue[])
{
    if(front==-1)
    {
        printf("nothing to delete\n");
        return;
    }
    else if(front==rear)
    {
        printf("%d deleted\n",queue[front]);
        front=-1;
        rear=-1;
    }
    else
    {
        printf("%d deleted\n",queue[front]);
        front++;
    }
}
int main()
{
    int queue[size],item,ch;
    do
    {
        printf("enter option\n");
        scanf("%d",&ch);
        switch(ch)
        {
        case 1:
            printf("enter the element\n");
            scanf("%d",&item);
            insertq(queue,item);
            break;
        case 2:
            deleteq(queue);
            break;
        case 3:
            showfront(queue);
            break;
        }
    }
    while(ch!=4);
}