Circular Queue Program

#include<stdio.h>

#include<stdlib.h>

#define que struct queue

#define pf printf

#define sf scanf

struct queue{

int info;

struct queue *link;

};

 que *front=NULL,*rear=NULL;

int count=0;

void insert(int n)

{

que *newnode;

newnode=(struct queue*)malloc(sizeof(struct queue));

newnode->info=n;

newnode->link=NULL;

if(count==0)

front=newnode;

else

        rear->link=newnode;

    rear=newnode;

    rear->link=front;

count++;

}

int del(void)

{

int n;

que *temp;

if(count==0)

return (-1);

count--;

    if(front==rear)

    {

        n=front->info;

        free(front);

        front=NULL;

        rear=NULL;

    }else

    {

            temp= front ;

            n = temp-> info ;

            front = front -> link ;

            rear -> link = front ;

            free ( temp ) ;

    }

return n;

}

void display(void)

{

que *temp;

int i;

if(count==0)

pf("Empty");

else

{

temp=front;

for(i=0;i<count;i++)

{

pf("%d ",temp->info);

temp=temp->link;

}

}

pf("\n");

}

int size(void)

{

return count;

}

int main()

{

int n,ch=10;

while(ch!=0)

{

pf("\n       What do you want to do??\n");

pf("1.Insert\n");

pf("2.Delete\n");

pf("3.SizeOfQueue\n");

pf("4.Display\n");

pf("0.EXIT\n");

sf("%d",&ch);

switch(ch)

{

case 1:

{

pf("What no. do you want to push in queue\n");

sf("%d",&n);

insert(n);

break;

}

case 2:

{

n=del();

if(n==-1)

pf("Queue is empty\n");

else

pf("Number poped from queue is %d\n",n);

break;

}

case 3:

{

n=size();

pf("Size of queue is %d\n",n);

break;

}

case 4:

{

pf("Queue is -->> ");

display();

}

case 0:

break;

default:

pf("Wrong Choice\n");

break;

}

}

}