using namespace std;
typedef int T;
#define MAXSIZE 100
struct SqList
{
T buf[MAXSIZE];
int Length;
};
void show(SqList &L);
void shellSort(SqList &L, int delta[], int t);
void shellInsert(SqList &L, int dk);
int main()
{
int temp[10] = {49, 38, 65, 97, 75, 13, 27, 49, 55, 4};
SqList L;
int dlta[3] = {5, 3, 1};
L.Length = 10;
for (int i = 1; i <= L.Length; i++)
{//顺序表L的0号元素不用
L.buf[i] = temp[i];
}
shellSort(L, dlta, 3);
show(L);
return 0;
}
void show(SqList &L)
{
for (int i = 1; i <= L.Length; i++)
{
cout << L.buf[i] << " ";
}
cout << endl;
}
void shellSort(SqList& L, int dlta[], int t)
{
for (int k = 0; k < t; k++)
{
shellInsert(L, dlta[k]);
}
}
void shellInsert(SqList& L, int dk)
{
int i, j;
for (i = dk + 1; i <= L.Length; ++i)
{
if (L.buf[i] < L.buf[i - dk])
{
L.buf[0] = L.buf[i];
for (j = i - dk; j > 0 && L.buf[0] < L.buf[j]; j -= dk)
{
L.buf[j + dk] = L.buf[j];
}
L.buf[j + dk] = L.buf[0];
}
}
}
方法二
#include<iostream>
using namespace std;
//一个数组元素是另个一数组的元素用一个for和两个函数
struct SqList
{
int temp[100];
int length;
};
void shellInsert(SqList &L,int data)
{
int i,j;
for(i=1+data;i<=L.length;i++)
{
L.temp[0]=L.temp[i];
for(j=i-data;L.temp[0]<L.temp[j];j-=data)
{
L.temp[j+data]=L.temp[j];
}
L.temp[j+data]=L.temp[0];
}
}
void shellSort(SqList &L,int data[],int t)
{
for(int i=0;i<t;i++)
{
shellInsert(L,data[i]);
}
}
void show(SqList L)
{
for(int i=1;i<=L.length;i++)
{
cout<<L.temp[i]<<" ";
}
cout<<endl;
}
void main()
{
int buf[10]={0,3,2,1,6,5,4,9,8,7};
SqList L;
L.length=9;
int data[3]={5,3,1};
for(int i=1;i<=L.length;i++)
{
L.temp[i]=buf[i];
}
shellSort(L,data,3);
show(L);
}