如何在c++中对没有STL的多个动态队列排序

struct Queue {
    int* data; // 队列数据
    int size;  // 队列大小
    int front; // 队首指针
    int rear;  // 队尾指针
};

const int numQueues = 3; // 队列数量
Queue* queues = new Queue[numQueues];

for (int i = 0; i < numQueues; i++) {
    queues[i].data = new int[initialSize]; // 初始大小
    queues[i].size = initialSize;
    queues[i].front = queues[i].rear = -1;
}

void enqueue(Queue& q, int value) {
    // 如果队列已满，扩展队列大小
    if ((q.rear + 1) % q.size == q.front) {
        int newSize = q.size * 2;
        int* newData = new int[newSize];

        // 复制旧数据到新数组
        int j = 0;
        for (int i = q.front; i != q.rear; i = (i + 1) % q.size) {
            newData[j++] = q.data[i];
        }
        newData[j] = q.data[q.rear];

        q.front = 0;
        q.rear = j;
        q.size = newSize;
        delete[] q.data;
        q.data = newData;
    }

    // 入队操作
    if (q.front == -1) {
        q.front = q.rear = 0;
    } else {
        q.rear = (q.rear + 1) % q.size;
    }
    q.data[q.rear] = value;
}

int dequeue(Queue& q) {
    if (q.front == -1) {
        throw std::runtime_error("队列为空！");
    }

    int value = q.data[q.front];

    if (q.front == q.rear) {
        q.front = q.rear = -1;
    } else {
        q.front = (q.front + 1) % q.size;
    }

    return value;
}

void quickSort(Queue& q, int left, int right) {
    if (left < right) {
        int pivot = partition(q, left, right);
        quickSort(q, left, pivot - 1);
        quickSort(q, pivot + 1, right);
    }
}

int partition(Queue& q, int left, int right) {
    int pivot = q.data[right];
    int i = left - 1;

    for (int j = left; j < right; j++) {
        if (q.data[j] <= pivot) {
            i++;
            swap(q.data[i], q.data[j]);
        }
    }
    swap(q.data[i + 1], q.data[right]);
    return i + 1;
}

for (int i = 0; i < numQueues; i++) {
    quickSort(queues[i], 0, queues[i].rear);
}