How can I implement a queue in C++?

How can I implement a queue in C++?

You can implement a queue in C++ using a linked list or an array. Which method would you prefer?

Let's go with the array implementation.

Great choice! You can create a class for the queue that includes methods for enqueue, dequeue, and checking if it's empty. Would you like a code example?

Yes, please provide a code example.

Here's a simple implementation:

class Queue {
private:
    int front, rear, size;
    unsigned capacity;
    int* array;

public:
    Queue(unsigned capacity) {
        this->capacity = capacity;
        front = this->size = 0;
        rear = capacity - 1;
        array = new int[this->capacity];
    }

    bool isFull() { return (size == capacity); }
    bool isEmpty() { return (size == 0); }

    void enqueue(int item) {
        if (isFull()) return;
        rear = (rear + 1) % capacity;
        array[rear] = item;
        size++;
    }

    int dequeue() {
        if (isEmpty()) return -1;
        int item = array[front];
        front = (front + 1) % capacity;
        size--;
        return item;
    }
};

Would you like to know more about any specific part of this code?