不知道lz是什么意思,题目easy,顺便我也写了一个,排序算法是插入排序;
#include
#include
#include
#define SIZE 6
void sort_insert(int *array, char *str, int size)
{
int i,j,temp,tempChar;
for(i=1; i
{
j = i-1;
temp = array[i];
tempChar = str[i];
while(j>=0 && temp>array[j])
{
array[j+1] = array[j];
str[j+1] = str[j];
j--;
}
array[j+1] = temp;
str[j+1] = tempChar;
}
return;
}
int main(void)
{
int array[SIZE];
char str[] = "ABCDEF";
printf("input %d nums:\n",SIZE);
for(int i=0; i
scanf("%d",&array[i]);
sort_insert(array,str,SIZE);
printf("after sort:\n");
for(i=0; i
printf("%c(%d) ",str[i],array[i]);
printf("\n");
return -1;
}