快速排序 quick sort

#include <iostream>
#include <vector>
template <typename T> 
inline void swap(T * t1, T * t2) {
    T tmp = *t1;
    *t1 = *t2;
    *t2 = tmp;
}

template <typename T>
void quicksort(std::vector<T> & vec, int sortBegin, int sortEnd) {
    if (sortEnd == sortBegin) return;
    if (sortEnd - sortBegin == 1) {
        if (vec[sortBegin] > vec[sortEnd]) swap(&vec[sortBegin], &vec[sortEnd]);
        return;
    }
    int i = sortBegin, j = sortEnd;
    auto pivot = vec[i];
    int Index = -1;
    while(true) {
        while(i != j && vec[j] > pivot) j--;
        if (i == j ) {
            Index = i;
            break;
        }
        vec[i++] = vec[j];
        while(i != j && vec[i] < pivot) i++;
        if (i == j ) {
            Index = i;
            break;
        }
        vec[j--] = vec[i];
    }
    vec[Index] = pivot;
    if (Index == sortBegin) {
        quicksort(vec, Index+1, sortEnd);
    } else if (Index == sortEnd) {
        quicksort(vec, sortBegin, Index-1);
    } else {
        quicksort(vec, sortBegin, Index-1);
        quicksort(vec, Index+1, sortEnd);
    }
}

int main() {
    std::vector<int> vec = {49,50,10, 8, 9, 11, 4, 2, 50, 49,49,51,30};
    quicksort<int>(vec, 0, vec.size()-1);
    for (auto & item : vec) {
        std::cout << item << std::endl;
    }
    return 0;
}

 运行：

2
4
8
9
10
11
30
49
49
49
50
50
51