Circular Queue

/*
    Created by Yash Pradhan
*/

#include<stdio.h>
#include<stdlib.h>
#define MAX 5

struct LinearQ
{
    int arr[MAX];
    int front;
    int rear;
}q;

int isFull();
int isEmpty();
void insert(int);
void delete();

void main()
{
    q.front=q.rear=-1;

    delete();

    insert(10);
    insert(20);
    insert(30);

    delete();
    delete();
    delete();
    delete();

    insert(10);
    insert(20);
    insert(30);
    insert(40);
    insert(50);

    insert(60);
    delete();
    insert(70);
    delete();
    delete();
    insert(80);
    insert(90);
    insert(100);
    delete();
    delete();
    delete();
    delete();
    delete();
    delete();
    insert(555);
    insert(999);
}

int isFull()
{
    if(((q.rear+1)%MAX)==q.front)
        return 1;
    else
        return 0;
}

int isEmpty()
{
    if(q.front==-1)
        return 1;
    else
        return 0;
}

void insert(int data)
{
    if(isFull())
    {
        printf("\nQueue is Full");
        return;
    }

    if(q.front==-1)
        q.front++;
    q.rear=(q.rear+1)%MAX;
    q.arr[q.rear]=data;
    printf("\nInserted %d",data);
    return;
}

void delete()
{
    if(isEmpty())
    {
        printf("\nQueue is Empty");
        return;
    }
    int temp=q.arr[q.front];
    if(q.front==q.rear)
    {
        q.front=q.rear=-1;
    }
    else
    {
        q.front=(q.front+1)%MAX;
    }
    printf("\ndeleted %d",temp);
    return;
}