using namespace std;
vector<int> ShellSort(vector<int> list)
{
vector<int> result = list;
int n = result.size();
for (int gap = n / 2; gap > 0; gap /= 2)
{
for (int i = gap; i < n; i++)
{
int temp = result[i];
int j = i - gap;
while (j >= 0 && result[j] > temp)
{
result[j + gap] = result[j];
j -= gap;
}
result[j + gap] = temp;
}
}
return result;
}
int main()
{
vector<int> vec;
int n;
cin >> n;
int a;
for(int i = 0; i < n; ++i)
{
cin >> a;
vec.push_back(a);
}
cout << "排序前" << endl;
result = ShellSort(test);
cout << "排序后" << endl;
system("pause");
}