排序算法

#include <iostream>
#include <vector>

using namespace std;

typedef struct {
    vector<int> r = {0};
    int length;
} SqList;

void swap(SqList * L, int i, int j) {
    int temp = L->r[i];
    L->r[i] = L->r[j];
    L->r[j] = temp;
}

int getPivot(SqList *L, int low, int high) {
    int pivot = L->r[low];
   
    while(low < high) {
        while(low < high && pivot <= L->r[high]) {
            high --;
        }
        swap (L, low, high);
        
        while(low < high && pivot > L->r[low]) {
            low ++;
        }
        swap (L, low, high);        
    }
    return low;
}

void QSort(SqList *L, int low, int high) {    
    if(low < high) {
        int pivot = getPivot(L, low, high);
        QSort(L, low, pivot-1);
        QSort(L, pivot+1, high);
    }
}

void QuickSort (SqList *L) {
    QSort(L, 1, L->length-1);
}

int main (int argc, char** argv) {
    SqList *sl = new SqList;
    
    int num = 0, temp = 0;
    
    cout << "cin the number of sqlist(include flag)" << endl;
    cin >> num;
    sl->length = num;
    
    for(int i = 0; i < num-1; ++i) {
        cin >> temp;
        sl->r.push_back(temp);
    }

    QuickSort(sl);
    
    for(int i = 0; i < num; ++i)
        cout << sl->r[i] << endl;
    
    return 0;
}