#include <stdio.h>
int main( )
{
int queue[10];
int max,num,i,item;
int front,rear;
//printf("Enter the size of queue");
//printf("Enter the no of elements in queue");
//printf("Enter the elements of queue");
printf("Queue before insertion : "); for(i=0;i<num;i++)
{
}
front = 0;
rear = num -1 ;
printf("Front end : %d\n",front
); printf("Rear end : %d\n",rear
); if (rear == max-1)
{
}
else
{
//printf("Enter the item you want to insert \n");
rear = rear + 1;
front = 0;
queue[rear] = item;
printf("Queue after insertion :"); for(i=0;i<=rear;i++)
{
}
printf("Front end : %d\n",front
); printf("Rear end : %d\n",rear
); }
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgbWFpbiggKQp7CiBpbnQgcXVldWVbMTBdOwogaW50IG1heCxudW0saSxpdGVtOwogaW50IGZyb250LHJlYXI7CiAvL3ByaW50ZigiRW50ZXIgdGhlIHNpemUgb2YgcXVldWUiKTsKIHNjYW5mKCIlZCIsJm1heCk7CiAvL3ByaW50ZigiRW50ZXIgdGhlIG5vIG9mIGVsZW1lbnRzIGluIHF1ZXVlIik7CiBzY2FuZigiJWQiLCZudW0pOwogLy9wcmludGYoIkVudGVyIHRoZSBlbGVtZW50cyBvZiBxdWV1ZSIpOwogcHJpbnRmKCJRdWV1ZSBiZWZvcmUgaW5zZXJ0aW9uIDogIik7CiBmb3IoaT0wO2k8bnVtO2krKykKIAl7CiAJCXNjYW5mKCIlZCIsJnF1ZXVlW2ldKTsKIAkJcHJpbnRmKCIgJWRcdCIscXVldWVbaV0pOwogCX0KIHByaW50ZigiXG4iKTsJCiBmcm9udCA9IDA7CiByZWFyID0gbnVtIC0xIDsKIHByaW50ZigiRnJvbnQgZW5kIDogJWRcbiIsZnJvbnQpOwogcHJpbnRmKCJSZWFyIGVuZCA6ICVkXG4iLHJlYXIpOwogaWYgKHJlYXIgPT0gbWF4LTEpCiAJewogCQlwcmludGYoIk92ZXJmbG93Iik7CiAJfQogZWxzZQogewogCS8vcHJpbnRmKCJFbnRlciB0aGUgaXRlbSB5b3Ugd2FudCB0byBpbnNlcnQgXG4iKTsKIAlzY2FuZigiJWQiLCZpdGVtKTsKIAlyZWFyID0gcmVhciArIDE7CiAJZnJvbnQgPSAwOwogCXF1ZXVlW3JlYXJdID0gaXRlbTsKIAlwcmludGYoIlF1ZXVlIGFmdGVyIGluc2VydGlvbiA6Iik7CiAJZm9yKGk9MDtpPD1yZWFyO2krKykKIAl7CiAJCXByaW50ZigiICVkXHQiLHF1ZXVlW2ldKTsKIAl9CiBwcmludGYoIlxuIik7CiBwcmludGYoIkZyb250IGVuZCA6ICVkXG4iLGZyb250KTsKIHByaW50ZigiUmVhciBlbmQgOiAlZFxuIixyZWFyKTsKIH0KIAlyZXR1cm4gMDsKfQo=