希尔排序

来源：互联网发布：管家婆进销存软件价格编辑：程序博客网时间：2024/06/10 03:45

#include<stdio.h>#include<stdlib.h>#include<iostream>using namespace std;typedef struct{    int *r;    int length;} sqlist;void createlink(sqlist &L){    int n;    L.length=0;    cout<<"输入链表长度:"<<endl;    cin>>n;    L.r=(int*)malloc((n+1)*sizeof(int));    int i;    cout<<"输入链表元素:"<<endl;    for(i=1; i<=n; i++)    {        cin>>L.r[i];        ++L.length;    }}void print(sqlist &L){    int i;    cout<<"输出链表元素:"<<endl;    for(i=1; i<=L.length; i++)        cout<<L.r[i]<<" ";    cout<<"\n";}void shellinsert(sqlist &L,int dk){    int i,j;    for(i=dk+1; i<=L.length; ++i)        if(L.r[i]<L.r[i-dk])        {            L.r[0]=L.r[i];            for(j=i-dk; j>0&&L.r[0]<L.r[j]; j-=dk)            {                L.r[j+dk]=L.r[j];            }            L.r[j+dk]=L.r[0];        }}void shellsort(sqlist &L){    createlink(L);    int len;    int k;    int dlta[105];    cout<<"输入增量序列长度:";    cin>>len;    cout<<"输入增量序列元素:\n";    for(k=0; k<len; k++)        cin>>dlta[k];    for(k=0; k<len; k++)        shellinsert(L,dlta[k]);    cout<<"希尔排序:\n";    print(L);}int main(){    sqlist l;    shellsort(l);    return 0;}

注意：增量序列中最后一个增量值必须等于1！

阅读全文

0 0