[sicily][排序]1154. Easy sort

// Problem#: 1154
// Submission#: 4559080
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <iostream>
using namespace std;
void mySwap(unsigned int* a, unsigned int* b) {
    unsigned int c = *a;
    *a = *b;
    *b = c;
}
int Partition(unsigned int data[], int length, int start, int end) {
    //if (data == NULL || length <= 0 || start < 0 || end >= length || start>end) {
    //  throw new exception("wrong");
    //}
    int randomIndex = (end + start) / 2;
    mySwap(&data[randomIndex], &data[end]);
    int smallFlag = start - 1;
    for (randomIndex = start; randomIndex < end; randomIndex++) {
        if (data[randomIndex] < data[end]) {
            smallFlag++;
            if (smallFlag != randomIndex) {
                mySwap(&data[smallFlag], &data[randomIndex]);
            }
        }
    }
    smallFlag++;
    mySwap(&data[smallFlag], &data[end]);
    //cout << "smallFlag:" << smallFlag << endl;
    //for (int i = 0; i <= end; i++) {
    //  cout << data[i] << " ";
    //}
    //cout << endl;
    return smallFlag;
}
void MyQsort(unsigned int data[], int length, int start, int end) {
    //if (data == NULL || length <= 0 || start <0 || end >= length || start>end)
    //  throw new exception("wrong");
    if (start == end)
        return;
    int index = Partition(data, length, start, end);
    if (index > start) {
        MyQsort(data, length, start, index - 1);
    }
    if (index < end) {
        MyQsort(data, length, index + 1, end);
    }
}
int main() {
    unsigned int data[1000];
    int TestCaseNum;
    cin >> TestCaseNum;
    while (TestCaseNum--) {
        int num;
        cin >> num;
        for (int i = 0; i < num; i++) {
            cin >> data[i];
        }
        MyQsort(data, num, 0, num - 1);
        for (int i = 0; i < num; i++) {
            cout << data[i] << endl;
        }
    }
    //system("PAUSE");
}