47 lines
1012 B
C++
47 lines
1012 B
C++
#include<iostream>
|
|
#include<vector>
|
|
|
|
using namespace std;
|
|
|
|
template<typename T>
|
|
void ShellSort(vector<T> &v) {
|
|
int gap = v.size() / 2;
|
|
|
|
while (gap > 0) {
|
|
for (int i = gap; i < v.size(); i++) {
|
|
T temp = v[i];
|
|
int j;
|
|
for (j = i; j >= gap && v[j - gap] > temp; j -= gap) {
|
|
v[j] = v[j - gap];
|
|
}
|
|
v[j] = temp;
|
|
}
|
|
cout << "间隔：" << gap << endl << "排序后：";
|
|
for (int k = 0; k < v.size(); ++k) {
|
|
cout << v[k] << " ";
|
|
}
|
|
cout << endl;
|
|
gap = gap / 2;
|
|
}
|
|
}
|
|
|
|
int main() {
|
|
vector<int> v = {1, 3, 2, 4, 6, 5, 7, 10, 9, 8};
|
|
vector<int>::iterator it;
|
|
cout << "排序前" << endl;
|
|
for (it = v.begin(); it != v.end(); it++) {
|
|
cout << *it << " ";
|
|
}
|
|
cout << endl;
|
|
|
|
ShellSort(v);
|
|
|
|
cout << "排序后：" << endl;
|
|
for (it = v.begin(); it != v.end(); it++) {
|
|
cout << *it << " ";
|
|
}
|
|
cout << endl;
|
|
|
|
return 0;
|
|
}
|