#include"stdio.h"
main()
{
int i=0;
unsigned int a[10] = {120,121,45,17,23,45,23,89,100,99};
unsigned int b[10];
int j;
printf("input a array:/n");
b[0]=a[0];
for( i=1; i<10; i++)
{
for(j=1;j<=i;j++)
{
if(a[i]>=b[i-j])//此时b的范围是0到i-1;
{
b[i-j+1] = a[i];
break;
}
else
{
b[i-j+1] = b[i-j];//向后移
}
if(i==j) b[0] = a[i];
}
}
for(i=0;i<10;i++)
{
printf("%d,",b[i]);
}
}
插值法排序
最新推荐文章于 2024-04-20 23:05:34 发布