按照【样例输入】 5 33 65 90 78 18 【样例输出】 18 33 90 78 65 18 33 65 78 90 18 33 65 78 90 修改

下面是修改后的代码：

#include <iostream>
using namespace std;

#define MAXSIZE 20
typedef int KeyType;
typedef int InfoType;

typedef struct {
    KeyType key;
    InfoType otherType;
} RedType;

typedef struct {
    RedType r[MAXSIZE + 1];
    int length;
} SqList;

int Partition(SqList& L, int low, int high) {
    int pivotkey;
    L.r[0] = L.r[low];
    pivotkey = L.r[low].key;
    while (low < high) {
        while (low < high && L.r[high].key >= pivotkey) --high;
        L.r[low] = L.r[high];
        while (low < high && L.r[low].key <= pivotkey) ++low;
        L.r[high] = L.r[low];
    }
    L.r[low] = L.r[0];
    return low;
}

void QSort(SqList& L, int low, int high) {
    int pivotloc, n;
    if (low < high) {
        pivotloc = Partition(L, low, high);
        QSort(L, low, pivotloc - 1);
        QSort(L, pivotloc + 1, high);
        for (int i = low; i <= high; i++) {
            cout << L.r[i].key << " ";
        }
        cout << endl;
    }
}

void QuickSort(SqList& L) {
    QSort(L, 1, L.length);
}

int main(void) {
    SqList L1;
    int i, count;
    for (i = 0; i < MAXSIZE; i++) {
        L1.r[i].key = 0;
    }
    L1.length = 0;
    cin >> count;
    while (count > 0 && L1.length < MAXSIZE) {
        cin >> L1.r[L1.length].key;
        L1.length++;
        count--;
    }
    QuickSort(L1);
    for (int i = 1; i <= L1.length; i++) {
        cout << L1.r[i].key << " ";
    }
    cout << endl;
    return 0;
}

修改的部分：

1. 在 `QSort` 函数中添加了输出语句，输出每一次划分后的结果。
2. 修改了 `for` 循环中的起始下标，使其从 `low` 开始，这样就只输出当前处理的部分，不会输出前面已经排好序的部分。