【数据结构】算法10.3 插入排序-表插入

#include<stdio.h>#include<string.h>#include<stdlib.h>#define TRUE 1#define FALSE 0#define OK 1#define ERROR 0#define INFEASIBLE -1#define OVERFLOW -2#define MAXINT -1#define EQ(a,b) ((a) == (b))#define LT(a,b) ((a) <  (b))#define LQ(a,b) ((a) <= (b))typedef int Status;typedef int ElemType;typedef int RcdType;#define SIZE 100typedef struct{    RcdType rc;  //记录项    int next;  //指针项}SLNode;typedef struct{    SLNode r[SIZE];  //0号单元为表头结点    int length;  //链表当前长度}SLinkListType;  //静态链表类型/*******************************声明部分****************************************//*******************************函数部分****************************************/Status CreateSLinkList(SLinkListType *SL){    int i;/*    printf("请输入静态链表长度：");    scanf("%d",&SL->length);    for(i = 1;i <= SL->length; i++){        printf("请输入值：");        scanf("%d",&SL->r[i].rc);        SL->r[i].next = i+1;    }*/    int arr[8] = {49,38,65,97,76,13,27,49};    SL->r[0].rc = MAXINT;    SL->r[0].next = 0;    SL->length = 8;    int j = 0;    for(i = 1;i <= SL->length; i++){        SL->r[i].rc = arr[j++];        SL->r[i].next = -1;    } //   SL->r[SL->length].next = 0;    return OK;}Status TraverseSLL(SLinkListType SL){    int i;    printf("key  : ");    for(i = 0;i<=SL.length;i++){        printf("%5d",SL.r[i].rc);    }    printf("\n");    printf("next : ");    for(i = 0;i<=SL.length;i++){        printf("%5d",SL.r[i].next);    }    printf("\n");    return OK;}int Sort(SLinkListType *SL){    int i,j,k;    for(i = 1;i<=SL->length;i++){        for(k=0,j=SL->r[k].next;j && LT(SL->r[j].rc,SL->r[i].rc);            k=j,j=SL->r[k].next);        SL->r[i].next = j;        SL->r[k].next = i;    }    return OK;}void Arrange(SLinkListType *SL){    int p,i,q;    SLNode temp;    p = SL->r[0].next;    for(i = 1;i <= SL->length;i++){        while(p < i)            p = SL->r[p].next;        q = SL->r[p].next;        if( p != i){            temp = SL->r[p];            SL->r[p] = SL->r[i];            SL->r[i] = temp;            SL->r[i].next = p;        }//if        p = q;    }//for}/*******************************主函数部分**************************************/int main(){    SLinkListType SL;    printf("创建静态链表：\n");    CreateSLinkList(&SL);    TraverseSLL(SL);    printf("\n修改指针：\n");    Sort(&SL);    TraverseSLL(SL);    printf("\n表插入排序：\n");    Arrange(&SL);    TraverseSLL(SL);    return 0;}