#include <stdio.h>
#include <stdlib.h>
void insert_sort(int *p,int len)
{
int i,j;
int key;
for (i = 1; i < len;i++)
{
key= p[i]; //插入数字;
j = i - 1; //目前数组;
while (j>0 && key>p[j]) //从大到小排列
{
p[j + 1] = p[j];
j–;
}
p[j + 1] = key;
}
for (i = 0; i < len; i++)
{
printf("%d “,p[i]);
}
}
/选择法排序,就是从每一趟未排序的数组中选出最小值/
void select_sort(int *p, int len)
{
int i, j;
int key;
int t;
for (i = 0; i < len; i++)
{
key = i;
/未排序的数组遍历/
for (j = i + 1; j < len; j++)
{
if (p[j]>p[key])
{
key = j;
}
t = p[key];
p[key] = p[i];
p[i] = t;
}
}
for (i = 0; i < len; i++)
{
printf(”%d ", p[i]);
}
}
/冒泡排序是两两进行比较/
void main()
{
int a[] = {99,16,34,5,81,65,12,20};
insert_sort(a, sizeof(a)/sizeof(int));
printf("yes\n ");
select_sort(a, sizeof(a) / sizeof(int));
system(“pause”);
}
排序
最新推荐文章于 2024-03-28 00:29:10 发布