#include<stdio.h> |
//数组下标排序法 |
//缺点:浪费空间(内存) 若b很大 需要申请更多的数组 |
void Array_sort( int n) |
{ |
int i,t,j,b,a1; |
printf ( "[a,b]\n" ); |
scanf ( "%d%d" ,&a1,&b); |
int a[b+1]; |
for (i=0;i<b+1;i++) |
a[i]=0; //初始化 |
printf ( "Please enter %d Numbers\n" ,n); |
for (i=1;i<=n;i++) //输入n个数 |
{ |
scanf ( "%d" ,&t); |
a[t]++; //标记次数 |
} |
printf ( "The order from small to big is :\n" ); |
for (i=0;i<b+1;i++) //检查 |
for (j=1;j<=a[i];j++) //出现几次打印几次 |
printf ( "%d " ,i); |
} |
int main() |
{ |
int n; |
printf ( "Please enter the number of Numbers to sort:\n" ); scanf ( "%d" ,&n); |
Array_sort(n); |
return 0; |
} |