假如不知道所需要排序的数字数量,这个时候就需要动态排一下序
#include <stdio.h>
#include <stdlib.h>
int compare_integers(void const *a,void const *b)
{
register int const *pa = a;
register int const *pb = b;
return *pa > *pb ? 1 : *pa < *pb ? -1 : 0;
}
int main()
{
int *array;
int n_values;
int i;
printf("How many values are there? ");
if(scanf("%d",&n_values) != 1 || n_values <= 0)
{
printf("Illegal number of values.\n");
exit(EXIT_FAILURE);
}
array = malloc(n_values * sizeof(int));
if(array == NULL)
{
printf("Cant't get memory for that many values.\n");
exit(EXIT_FAILURE);
}
for(i=0;i<n_values;i+=1)
{
printf("? ");
if(scanf("%d",array+i) != 1)
{
printf("Error reading value #%d\n",i);
free(array);
exit(EXIT_FAILURE);
}
}
qsort(array,n_values,sizeof(int ),compare_integers);
for(i=0;i<n_values;i++)
{
printf("%d ",array[i]);
}
free(array);
return EXIT_SUCCESS;
}
测试结果:
How many values are there? 3
? 8
? 6
? 5
5 6 8