Queue implementation in C

#include<stdio.h>
#define MAX 5
int a[MAX];
int i,j,k,item;
int front=-1,rare=-1 ;
void push();
void pop();
void push()
{
printf("enter item");
scanf("%d",&item);
if(front==-1&&rare==-1)
{
front=0;
rare=0;
a[rare]=item;
}
else if((front==0&&rare==(MAX-1))||(front==rare+1))
{
printf("OVERFLOW\n");
}
else if(rare==MAX-1)
{
rare=0;
}
else
{
rare=rare+1;
a[rare]=item;
}
printf("rare= %d, max=%d\n",rare,MAX);
printf("array after insertion\n");
for(j=front;j<=rare;j++)
{
printf("%d ",a[j]);
}
}
void pop()
{
if(rare==-1&&front==-1)
{
printf("underflow\n");
}
else
{
item=a[front];
if(front==rare)
{
 front=rare=NULL;
}
else if(front==MAX-1)
{
front=0;
}
else
{
front=front+1;
}
}
printf("array after deletion\n");
for(j=front;j<=rare;j++)
{
printf("%d ",a[j]);
}
}
main()
{
for(k=0;k!=10;)
{
printf("\nenter 10 for break");
scanf("%d",&k);
printf("enter choice 1 for push and 2 for pop");
scanf("%d",&i);
if(k!=10)
{
if(i==1)
{
push();
}
else if(i==2)
{
pop();
}
}
else
{
break;
}
}
}


for more code you can visit http://codesofprogramming.blogspot.in/