#include<iostream>
using namespace std;
#define MAX 20
typedef int SqList[MAX];
void InsertSort(SqList &L,int n)//直接插入排序
{
for(int i = 2;i < n; ++i)//从下标为2开始
{
if(L[i]<=L[i-1])
{
L[0]=L[i];//哨兵位赋值
for(int j = i-1;L[0] < L[j]; --j)//记录后移,L[0]<L[j]的妙用
{
L[j+1]=L[j];
}
L[j+1]=L[0];//赋值
}
}
}
void BInsertSort(SqList &L,int n)//折半插入排序
{
for(int i = 2;i < n;++i)
{
L[0]=L[i];//将L[i]暂时存储到L[0]
int low=1;
int heigh=i-1;
int mid;
while(low <= heigh)//在[low,heigh]中折半查找有序的插入位置
{
mid=(low+heigh)/2;//折半
if(L[i]<mid)
{
heigh=mid-1;//折半点在低半区
}
else
{
low=mid+1;//折半点在高半区
}
}
for(int j=i-1;j>=heigh+1;--j)//记录后移
{
L[j+1]=L[j];
}
L[heigh+1]=L[0];
}
}
void TWayInsertSort(SqList &L,int n)//2路插入排序
{
SqList T;
T[0]=L[0];
int first;
int last;
first=last=0;
for(int i = 1;i < n;++i)
{
if(L[i]<T[first])
{
first=(first-1+n)%n;
T[first]=L[i];
}
else if(L[i]>T[last])
{
last++;
T[last]=L[i];
}
else
{
last++;
T[last]=T[last-1];
for(int j = last-1;L[i]<T[(j-1+n)%n];j=(j-1+n)%n)
{
T[j]=T[(j-1+n)%n];
}
T[j]=L[i];
}
}
for(i=0;i<n;++i)
{
L[i]=T[first];
first=(first+1)%n;
}
}
void ShellInsert(SqList &L,int n,int k)//希尔插入
{
for(int i = k+1;i < n;++i) //按增量值插入
{
if(L[i] < L[i-k]) //比较大小
{
L[0] = L[i]; //暂存
for(int j = i - k;j>1&&L[0]<L[j];j -= k)//组内插入排序,谨记j>1这个条件
{
L[j+k] = L[j];
}
L[j+=k] = L[0]; //赋值
}
}
}
void ShellSort(SqList &L,int n,int dlta[],int t)//希尔排序
{
for(int k = 0;k < t;++k) //按照增量数组值重复插入排序
{
ShellInsert(L,n,dlta[k]);
}
}
void main()
{
SqList sq={0,49,38,65,97,76,13,27,49};//有哨兵位
for(int i = 1;i < 9; ++i)//打印sq
{
cout<<sq[i]<<" ";
}
cout<<endl;
SqList sq2={49,38,65,97,76,13,27,49};//无哨兵位
for( i = 0;i < 8; ++i)//打印sq2
{
cout<<sq2[i]<<" ";
}
cout<<endl;
InsertSort(sq,9);//直接插入结果打印
for( i = 1;i < 9; ++i)//打印sq
{
cout<<sq[i]<<" ";
}
cout<<endl;
BInsertSort(sq,9);//折半插入结果打印
for( i = 1;i < 9; ++i)//打印sq
{
cout<<sq[i]<<" ";
}
cout<<endl;
TWayInsertSort(sq2,8);//2路插入结果打印
for( i = 0;i < 8; ++i)//打印sq
{
cout<<sq2[i]<<" ";
}
cout<<endl;
int dlta[] = {5,3,2,1}; //增量数组
ShellSort(sq,8,dlta,sizeof(dlta)/sizeof(int));//希尔排序结果打印
for(i = 1;i < 9; ++i)
{
cout<<sq[i]<<" ";
}
cout<<endl;
}
<img src="https://img-blog.csdn.net/20150616142205002?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQvd2VpY2hhbmp1YW4z/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />