59 lines
1.2 KiB
C++
59 lines
1.2 KiB
C++
// 编写一个程序，实现直接插入排序算法。用相关数据进行测试，并输出各趟的排序结果。
|
|
|
|
#include<iostream>
|
|
#include<vector>
|
|
|
|
using namespace std;
|
|
|
|
template<typename T>
|
|
void InsertSort(vector<T> &v) {
|
|
for (int i = 1; i < v.size(); i++) {
|
|
T key = v[i];
|
|
int j = i - 1;
|
|
|
|
while (j >= 0 && v[j] > key) {
|
|
v[j + 1] = v[j];
|
|
j = j - 1;
|
|
}
|
|
v[j + 1] = key;
|
|
|
|
cout << "第" << i << "趟排序：" << endl;
|
|
cout << "插入前：";
|
|
for (int k = 0; k < j + 1; k++) {
|
|
cout << v[k] << " ";
|
|
}
|
|
cout << "(" << key << ")";
|
|
for (int k = i + 2; k < i; k++) {
|
|
cout << v[k] << " ";
|
|
}
|
|
cout << endl;
|
|
|
|
cout << "插入后：";
|
|
for (int k = 0; k < v.size(); k++) {
|
|
cout << v[k] << " ";
|
|
}
|
|
cout << endl;
|
|
}
|
|
}
|
|
|
|
int main() {
|
|
vector<int> v = {1, 3, 2, 4, 6, 5, 7, 10, 9, 8};
|
|
|
|
cout << "排序前：" << endl;
|
|
for (int i = 0; i < v.size(); i++) {
|
|
cout << v[i] << " ";
|
|
}
|
|
cout << endl;
|
|
|
|
|
|
InsertSort(v);
|
|
|
|
cout << "排序后：" << endl;
|
|
for (int i = 0; i < v.size(); i++) {
|
|
cout << v[i] << " ";
|
|
}
|
|
cout << endl;
|
|
|
|
return 0;
|
|
}
|