shell排序的特点是,按一定的步长抽取序列中的子元素,构成子序列,然后
对子序列进行插入排序,如此循环直到步长为1,此时整个序列作为整体进行插入
排序,由于之前的步骤已经保证子序列的有序性,故而,最后的插入排序时间复
杂度很小,整体性能优异。
头文件
#ifndef SHELLSORT_H
#define SHELLSORT_H
#include <vector>
#include <iostream>
using std::vector;
using std::cout;
using std::endl;
template <typename T>
class ShellSort
{
private:
unsigned len;
vector<T> list;
public:
/*
* Construction function
*/
ShellSort(vector<T> _list, unsigned _len)
{
for (unsigned i = 0; i < _len; ++i)
list.push_back(_list[i]);
this->len = _len;
}
/*
* Shellsort function
*/
void shellSort()
{
int insertNum;
unsigned gap = len/2; // initial increment
std::cout << "序列中, 对所有中间间隔为 gap - 1 个的子元素构成的子序列进行插入排序" << endl;
std::cout << "相当于每隔 gap -1 抽取一个元素,构成子序列, 对其插入排序" << endl;
std::cout << "如此一来可得结论: 一共 gap 个子序列, 每个包含元素 N/gap" << endl;
std::cout << "-----------------------gap = " << gap << "-----------------" << endl;
while(gap) // while gap>=1
{
for (unsigned i = gap; i < len; ++i) // Insertsort within subsequence
{
insertNum = list[i];// Target number to be inserted into the subsequence
unsigned j = i;
while (j >= gap && insertNum < list[j-gap])// Find position, insert list[i] among list[i-gap], list[i-2*gap], list[i-3*gap]...
{
list[j] = list[j - gap];
j -= gap;
}
list[j] = insertNum;
out();
}//end for
gap /= 2;
std::cout << "----------------------gap = " << gap << "-----------------" << endl;
}//end while(gap)
}// end shellSort
/*
* Display the sorted result
*/
void out()
{
for (unsigned i = 0; i < len; ++i)
{
cout << list[i] << " ";
if ((i + 1) % 18 == 0) cout << endl;
}
cout << endl;
}
};
#endif
源文件
//shellSortTest
#include "shell.h"
#include <vector>
using namespace std;
//const unsigned numEle = 10;
//int data[numEle] = {99, 11, 55, 77, 33, 88, 0, 22, 66, 44};
const unsigned numEle = 18;
int data[numEle] = {99, 11, 55, 77, 33, 88, 0, 22, 66, 44, 9, 7, 2, 4, 5, 8, 6, 3};
int main()
{
vector<int> testData;
for (unsigned i = 0; i < numEle; ++i)
testData.push_back(data[i]);
ShellSort<int> test(testData, numEle);
cout << "===============================================" << endl;
test.out();
cout << "===============================================" << endl;
test.shellSort();
cout << "===============================================" << endl;
test.out();
cout << "===============================================" << endl;
return 0;
}
结果测试
➜ c++ ./a.out
===============================================
99 11 55 77 33 88 0 22 66 44 9 7 2 4 5 8 6 3
===============================================
对所有中间间隔为 gap - 1 个元素构成的子序列进行插入排序
相当于每隔 gap -1 抽取一个元素,构成子序列, 对其插入排序
如此一来可得结论: 一共 gap 个子序列, 每个包含元素 N/gap
-----------------------gap = 9-----------------
44 11 55 77 33 88 0 22 66 99 9 7 2 4 5 8 6 3
44 9 55 77 33 88 0 22 66 99 11 7 2 4 5 8 6 3
44 9 7 77 33 88 0 22 66 99 11 55 2 4 5 8 6 3
44 9 7 2 33 88 0 22 66 99 11 55 77 4 5 8 6 3
44 9 7 2 4 88 0 22 66 99 11 55 77 33 5 8 6 3
44 9 7 2 4 5 0 22 66 99 11 55 77 33 88 8 6 3
44 9 7 2 4 5 0 22 66 99 11 55 77 33 88 8 6 3
44 9 7 2 4 5 0 6 66 99 11 55 77 33 88 8 22 3
44 9 7 2 4 5 0 6 3 99 11 55 77 33 88 8 22 66
----------------------gap = 4-----------------
4 9 7 2 44 5 0 6 3 99 11 55 77 33 88 8 22 66
4 5 7 2 44 9 0 6 3 99 11 55 77 33 88 8 22 66
4 5 0 2 44 9 7 6 3 99 11 55 77 33 88 8 22 66
4 5 0 2 44 9 7 6 3 99 11 55 77 33 88 8 22 66
3 5 0 2 4 9 7 6 44 99 11 55 77 33 88 8 22 66
3 5 0 2 4 9 7 6 44 99 11 55 77 33 88 8 22 66
3 5 0 2 4 9 7 6 44 99 11 55 77 33 88 8 22 66
3 5 0 2 4 9 7 6 44 99 11 55 77 33 88 8 22 66
3 5 0 2 4 9 7 6 44 99 11 55 77 33 88 8 22 66
3 5 0 2 4 9 7 6 44 33 11 55 77 99 88 8 22 66
3 5 0 2 4 9 7 6 44 33 11 55 77 99 88 8 22 66
3 5 0 2 4 9 7 6 44 33 11 8 77 99 88 55 22 66
3 5 0 2 4 9 7 6 22 33 11 8 44 99 88 55 77 66
3 5 0 2 4 9 7 6 22 33 11 8 44 66 88 55 77 99
----------------------gap = 2-----------------
0 5 3 2 4 9 7 6 22 33 11 8 44 66 88 55 77 99
0 2 3 5 4 9 7 6 22 33 11 8 44 66 88 55 77 99
0 2 3 5 4 9 7 6 22 33 11 8 44 66 88 55 77 99
0 2 3 5 4 9 7 6 22 33 11 8 44 66 88 55 77 99
0 2 3 5 4 9 7 6 22 33 11 8 44 66 88 55 77 99
0 2 3 5 4 6 7 9 22 33 11 8 44 66 88 55 77 99
0 2 3 5 4 6 7 9 22 33 11 8 44 66 88 55 77 99
0 2 3 5 4 6 7 9 22 33 11 8 44 66 88 55 77 99
0 2 3 5 4 6 7 9 11 33 22 8 44 66 88 55 77 99
0 2 3 5 4 6 7 8 11 9 22 33 44 66 88 55 77 99
0 2 3 5 4 6 7 8 11 9 22 33 44 66 88 55 77 99
0 2 3 5 4 6 7 8 11 9 22 33 44 66 88 55 77 99
0 2 3 5 4 6 7 8 11 9 22 33 44 66 88 55 77 99
0 2 3 5 4 6 7 8 11 9 22 33 44 55 88 66 77 99
0 2 3 5 4 6 7 8 11 9 22 33 44 55 77 66 88 99
0 2 3 5 4 6 7 8 11 9 22 33 44 55 77 66 88 99
----------------------gap = 1-----------------
0 2 3 5 4 6 7 8 11 9 22 33 44 55 77 66 88 99
0 2 3 5 4 6 7 8 11 9 22 33 44 55 77 66 88 99
0 2 3 5 4 6 7 8 11 9 22 33 44 55 77 66 88 99
0 2 3 4 5 6 7 8 11 9 22 33 44 55 77 66 88 99
0 2 3 4 5 6 7 8 11 9 22 33 44 55 77 66 88 99
0 2 3 4 5 6 7 8 11 9 22 33 44 55 77 66 88 99
0 2 3 4 5 6 7 8 11 9 22 33 44 55 77 66 88 99
0 2 3 4 5 6 7 8 11 9 22 33 44 55 77 66 88 99
0 2 3 4 5 6 7 8 9 11 22 33 44 55 77 66 88 99
0 2 3 4 5 6 7 8 9 11 22 33 44 55 77 66 88 99
0 2 3 4 5 6 7 8 9 11 22 33 44 55 77 66 88 99
0 2 3 4 5 6 7 8 9 11 22 33 44 55 77 66 88 99
0 2 3 4 5 6 7 8 9 11 22 33 44 55 77 66 88 99
0 2 3 4 5 6 7 8 9 11 22 33 44 55 77 66 88 99
0 2 3 4 5 6 7 8 9 11 22 33 44 55 66 77 88 99
0 2 3 4 5 6 7 8 9 11 22 33 44 55 66 77 88 99
0 2 3 4 5 6 7 8 9 11 22 33 44 55 66 77 88 99
----------------------gap = 0-----------------
===============================================
0 2 3 4 5 6 7 8 9 11 22 33 44 55 66 77 88 99
===============================================