C++ Primer中的一个sort算法源码

该算法采用分而治之的方法来进行排序，思想不错

//排序里面有std的sort了，效率更高，这个例子不是为了取代std::sort的，放在这里是做为一个例子体现分而治之的思想
template<typename Type>
Type min(Type a, Type b) {
    //Type 类型需要实现了小于号的重载
    return a < b ? a : b;
}

template<typename elemType>
void swap(std::vector<elemType> &array, int i, int j) {
    elemType tmp = array[i];
    array[i] = array[j];
    array[j] = tmp;
}

template<typename elemType>
void sort(vector<elemType> &array, int low, int high) {
    if(low < high) {
        int lo = low;
        int hi = high + 1;
        elemType elem = array[lo];

        while(1) {
            while(min(array[++lo], elem) != elem && lo < high);
            //find the value bigger than low elem
            while(min(array[--hi], elem) == elem && hi > low);
            //find the value smaller than low elem
            if(lo < hi) // if bigger value is before the smaller value,swap them
                swap(array, lo, hi);
            else break;
        }
        swap(array, low, hi);//the hi value smaller than low elem ,swap them
        sort(array, low, hi-1);
        sort(array, hi+1, high);
    }
}