typedef数据结构8638直接插入排序

#include<stdio. h>

#def ine MAXSIZE 20

#def ine LT(a,b) ( (a)<(b) )typedef int KeyType;typedef struct

{

KeyType key;

} RedType;typedef struct

{

RedType r [MAXSIZE+1] ;int length;

} SqList;

1

void InsertSort(SqList &L)

{int i , j,k;for ( i=2; i<=L. length; i++)

{if(LT(L. r [ i ] .key,L. r [ i-1] .key) )

{

L. r [0]=L. r [ i ] ;

L. r [ i ]=L. r [ i-1] ;for (j=i-2;

LT(L. r [0] .key,L. r [j] .key) ; j--)

L. r [j+1]=L. r [j] ;

L. r [j+1]=L. r [0] ;

}for (k=1 ; k<=L. length; k++)pr intf("%d ",L. r [k] .key) ;

2

pr intf("\n") ;

}

}int main()

{

SqList L;int i ;scanf("%d",&L. length) ;for ( i=1 ; i<=L. length; i++)scanf("%d",&L. r [ i ] .key) ;InsertSort(L) ;return 0;

}

3