快速排序实现_c++

template<class Type>void ShellSort(vector<Type>& v){for (int gap = v.size(); gap > 0; gap /=2){for (int i = gap; i < v.size(); ++i){Type tmp = v[i];int j = i;for (; j >= gap && tmp < v[j-gap]; j -= gap){v[j] = v[j - gap];}v[j] = tmp;}}}