希尔排序可以说是插⼊排序的⼀种变种。希尔排序就是为了加快速度简单地改进了插⼊排序,交换不相邻的元素以对数组的局部进⾏排序。
先预排序(分组,插入排序),缩小增量(组数)排序
#include <iostream>
#include <vector>
#include <cstdlib>
#include <ctime>
using std::cout;
using std::endl;
using std::vector;
void shellSort(vector<int>& nums) {
for (int gap = nums.size() >> 1; gap > 0; gap >>= 1) { //先分组,gap表示分组大小,结束条件是gap == 1
for (int i = gap; i < nums.size(); i++) { //来牌从gap开始
int insertVal = nums[i]; //保存要插入的数值
int j;
for (j = i - gap; j >= 0 && nums[j] > insertVal; j -= gap) { //同一分组相差gap
//注意插入排序的j的结束条件是>=0不是>0
nums[j + gap] = nums[j];
}
nums[j + gap] = insertVal;
}
}
}
void print(vector<int>& nums) {
for (vector<int>::iterator iter = nums.begin(); iter != nums.end(); iter++) {
cout << *iter << ' ';
}
cout << endl;
}
void test() {
std::srand(std::time(nullptr));
vector<int> nums;
for (size_t i = 0; i < 10000000; i++) {
nums.push_back(rand() % 99);
}
time_t beg = std::time(nullptr);
//print(nums);
shellSort(nums);
//print(nums);
time_t end = std::time(nullptr);
cout << end - beg << endl;
}
int main() {
test();
}
时间复杂度:O(N^1.3)