直接插入排序
#include <bits/stdc++.h>
using namespace std;
vector <int> seq;
void insertSort()
{
for (int i = 1; i < seq.size(); i++){
tmp = seq[i];
for (int j = i - 1; j > -2; j--){
if (j >= 0 and tmp < seq[j]){
seq[j + 1] = seq[j];
}else{
break;
}
}
seq[j + 1] = tmp;
}
return;
}
以上就是直接插入排序的算法,也是三点: