顺序表-希尔排序

#include<bits/stdc++.h>
#define MAX 100
typedef struct{
    int *Elem;
    int length;
}SeqList; 
void creat(SeqList &s)
{
    s.Elem = (int*)malloc(MAX*sizeof(int));
    if(!s.Elem){
        printf("创建失败\n");
        exit(1);
    }
    int n,m,j;
    printf("请输入元素以-1结束：\n");
    scanf("%d",&n);
    s.length = 0;
    while(n!=-1){
        s.Elem[s.length++] = n;
        scanf("%d",&n);
    }
}
void print(SeqList s)
{
    int i;
    for(i=0;i<s.length;i++){
        printf("%d ",s.Elem[i]);
    }
}
void ShellSort(SeqList &s)
{
    int gap,i,j,temp,len = s.length,k;
    for(gap=len/2;gap>0;gap/=2){
        for(i=0;i<gap;++i){
            for(j=i+gap;j<len;j+=gap){
                temp = s.Elem[j];
                k = j-gap;
                while(k>=0&&s.Elem[k]>temp){
                    s.Elem[k+gap] = s.Elem[k];
                    k -=gap;
                }
                s.Elem[k+gap] = temp;
            }
        }
    }
}
void ShellSort1(SeqList &s){
    int d,i,j,temp;
    for(d=s.length/2;d>0;d/=2)
    {
        for(i=d+1;i<s.length;i++){
            temp =     s.Elem[i];
            for(j = i-d;j>0&&temp<s.Elem[j];j = j-d){
                s.Elem[j+d] = s.Elem[j];
            }
            s.Elem[j+d] = temp;
        }
    }
    for(i=1;i<s.length;i++){
        if(s.Elem[0]<s.Elem[i]){
            temp = s.Elem[0];
            for(j=1;j<i;j++){
                s.Elem[j-1] = s.Elem[j];
            }
            s.Elem[j-1] = temp;
            return;
        }
    }
}
int main(){
    SeqList s;
    creat(s);
    ShellSort(s);
    print(s);
}