queue.cpp

#include <iostream>
using namespace std;

struct queue
{
    int front;
    int rear;
    int arr[100];
};

bool isfull(queue &q)
{
    return q.rear == 100 - 1;
}

bool isEmpty(queue &q)
{
    return q.front == -1;
}

void Equeue(queue &q, int x)
{
    if (isfull(q))
    {
        cout << "the queue is full :";
        return;
    }
    if (q.front == -1)
        q.front++;

    q.arr[++q.rear] = x;
    cout << q.rear;
}
void Dequeue(queue &q)
{
    if (isEmpty(q))
    {
        cout << "the queue is empty ";
        return;
    }
    if (q.front == q.rear)
    {
        q.front = q.rear = -1;
        return;
    }
    q.front++;
}
int getSize(queue &q)
{
    if (isEmpty(q))
    {
        return 0;
    }
    return (q.rear - q.front + 1);
}
void display(queue &q)
{
    cout << "the list of the queue is :\n";
    int front = q.front;
    while ((q.front != q.rear) || q.rear != 0)
    {
        cout << q.arr[front] << ' ';
    }
}
int main()
{
    queue q;
    q.front = -1;
    q.rear = -1;
    Equeue(q, 1);
    Equeue(q, 2);
    cout << "the size of queue is: " << getSize()
}