#include<stdio.h>
#include<iostream>
#define MAXL 100
typedef int KeyType;
typedef char InfoType;
typedef struct
{
KeyType key;
InfoType data;
}RecType;
void Display(RecType R[], int n)
{
for (int i = 0; i < n; i++)
{
printf("%d", R[i].key);
}
printf("\n");
}
void InsertSort(RecType R[], KeyType keys[], int n)
{
int i, j; RecType temp;
for (int i = 0; i < n; i++)
{
R[i].key = keys[i];
}
printf("排序前:");
Display(R, n);
for (i = 1; i < n; i++)
{
printf("i=%d,插入%d,插入结果:", i, R[i].key);
if (R[i].key < R[i - 1].key)
{
temp = R[i];
j = i - 1;
do
{
R[j + 1] = R[j];
j--;
} while (j >= 0 && R[j].key > temp.key);
R[j + 1] = temp;
}
Display(R, n);
}
}
int main()
{
int n = 10;
KeyType a[] = { 9,8,2,6,5,4,1,3,7,0 };
RecType R[MAXL];
InsertSort(R, a, n);
printf("排序后:");
Display(R, n);
system("pause");
return 1;
}
排序方法1---直接插入排序
猜你喜欢
转载自blog.csdn.net/Yun_Ge/article/details/85476267
今日推荐
周排行