#include <stdio.h>
#include <stdlib.h>
#define MAX 60
int top=0,bottom=0;
int Queue[MAX];
int ToQueue(int element)
{
if(top==MAX)
{
printf("The Queue is full\n");
return -1;
}
else
{
Queue[top]=element;
top++;
return element;
}
}
int FromQueue(int *element)
{
if(top==bottom)
{
printf("The Queue is empty\n");
return -1;
}
else
{
*element=Queue[bottom];
bottom++;
return *element;
}
}
int main()
{
int element=0;
for(int i=0;i<MAX;i++)
{
ToQueue(i);
}
for(int i=0;i<MAX;i++)
{
FromQueue(&element);
printf("%d\n",element);
}
}
#include <stdlib.h>
#define MAX 60
int top=0,bottom=0;
int Queue[MAX];
int ToQueue(int element)
{
if(top==MAX)
{
printf("The Queue is full\n");
return -1;
}
else
{
Queue[top]=element;
top++;
return element;
}
}
int FromQueue(int *element)
{
if(top==bottom)
{
printf("The Queue is empty\n");
return -1;
}
else
{
*element=Queue[bottom];
bottom++;
return *element;
}
}
int main()
{
int element=0;
for(int i=0;i<MAX;i++)
{
ToQueue(i);
}
for(int i=0;i<MAX;i++)
{
FromQueue(&element);
printf("%d\n",element);
}
}