插入排序

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<time.h>
#define MAXSIZE 10
typedef int KeyTape;
typedef struct 
{
KeyTape key;
//。。。。。。其他信息
}RedType;
typedef struct{
RedType r[MAXSIZE + 1];//r[0]做哨兵
int length;
}SqList;
//直接插入排序
void InsertSort(SqList *L)
{
for (int i = 2; i <= L->length; i++)
{
if (L->r[i].key<L->r[i-1].key)
{
L->r[0] = L->r[i];
L->r[i] = L->r[i - 1];
int j;
for (j = i-2;L->r[0].key<L->r[j].key; j--)
{
L->r[j + 1] = L->r[j];
}
L->r[j + 1] = L->r[0];
}
}
}
//打印关键字
void PrintList(SqList  L)
{
for (int i = 1; i <= L.length; i++)
{
printf("%d  ",L.r[i].key);
}
printf("\n");
}
int main()
{
SqList L;
srand(time(0));
L.length = 5;
for (int i = 1; i <=L.length; i++)
{
L.r[i].key = rand() % 100 + 1;
}
PrintList(L);
InsertSort(&L);
PrintList(L);
return 0;

}