Queue using array -- Data structure Pgm

//Queue using array

#include
#include
#define MAX 5int q[MAX],rear=-1,front=0;
void Enqueue();
void Dequeue();
void Display();
void main()
{
int choice;
clrscr();
printf("\n\n1.Enqueue\n2.Dequeue\n3.Display\n4.Exit");
while(1)
{
printf("\n\nEnter ur choice:-->");
scanf("%d",&choice);
switch (choice)
{
case 1: Enqueue(); break;
case 2: Dequeue(); break;
case 3: Display(); break;
case 4: exit(0);
}
}
}
void Enqueue()
{ int item;
if (rear==MAX)
printf("\n\nQueue is Full");
else { rear++; printf("\n\n enter the detail:->"); s
canf("%d",&item); q[rear]=item;
}
Display();
}
void Dequeue()
{
int item,i;
if (rearprintf("\n\nQueue is Empty");
else { item=q[front];
for(i=front;i rear--;
printf("\n\nthe deleted detail is %d",item);
Display();
}
}
void Display()
{
int i;
if (rearprintf("\n\nQueue is Empty");
else
{
printf("\n\n Queue elements are\n\n front:");
for(i=front;i<=rear;i++)
printf("%d<--",q[i]);
printf(":rear");
}
}

_______________________*ALL THEBEST*_____________________________


With Regards,
5stararun.....