69,373
社区成员
发帖
与我相关
我的任务
分享
#include"stdio.h"
#include"stdlib.h"
void insertionsort (int* b,int n){
int j,key,i;
for(j=1;j <=n-1;j++)
{
key=b[j];
i=j-1;
while(b[i] > key && i >= 0)
{
b[i+1]=b[i];
i--;
}
b[i+1]=key;
}
for(i = 0;i <=n-1;i++)
printf("%d",b[i]);
printf("\n");
}
void main (){
int n = getchar()-'0';/*先输入数组大小,实验算法所以就不用动态了*/
int i;
int *a = malloc(sizeof(int) * n);
char c;
for(i=0;i <=n-1&&(c=getchar())!=EOF;i++)/*数组初始化*/
a[i]=c-'0';
insertionsort(a, n);
system("pause");
}
#include"stdio.h"
#include"stdlib.h"
void insertionsort (int* b,int n){
int j,key,i;
for(j=1;j <=n-1;j++)
{
key=b[j];
i=j-1;
while(b[i] > key && i >= 0)
{
b[i+1]=b[i];
i--;
}
b[i+1]=key;
}
for(i = 0;i <=n-1;i++)
printf("%d",b[i]);
printf("\n");
}
void main (){
int n = getchar()-'0';/*先输入数组大小,实验算法所以就不用动态了*/
int i;
int *a = malloc(sizeof(int)*n);
char c;
for(i=0;i <=n-1&&(c=getchar())!=EOF;i++)/*数组初始化*/
a[i]=c-'0';
insertionsort(a, n);
system("pause");
}