If you can't read please download the document
Upload
bhavya-chawla
View
215
Download
1
Embed Size (px)
DESCRIPTION
circular queue
Citation preview
// Bhavya Chawla// XII-A// circular queue#include#include#include int front=-1; int rear=-1;void insert(int a[],int x,int size){ if(((front==0)&&(rear==size-1))||(front==rear+1)) { cout