Queue.cpp

#include "Queue.h"

void Queue::resize() {
    int newCapacity = capacity * 2;
    int* newArr = new int[newCapacity];
    for (int i = 0; i < length; i++) {
        newArr[i] = arr[(front + i) % capacity];
    }
    delete[] arr;
    arr = newArr;
    capacity = newCapacity;
    front = 0;
    rear = length - 1;
}

Queue::Queue(int initialCapacity) {
    arr = new int[initialCapacity];
    capacity = initialCapacity;
    length = 0;
    front = 0;
    rear = -1;
}

Queue::~Queue() {
    delete[] arr;
}

void Queue::enquque(int x) {
    if (length == capacity) {
        resize();
    }
    rear = (rear + 1) % capacity;
    arr[rear] = x;
    length++;
}

void Queue::dequeue() {
    if (isEmpty()) {
        cout << "Queue Underflow\n";
        return;
    }
    front = (front + 1) % capacity;
    length--;
}

int Queue::Front() {
    if (isEmpty()) {
        cout << "Queue is empty\n";
        return 0;
    }
    return arr[front];
}

bool Queue::isEmpty() {
    return length == 0;
}