数据结构===基数排序算法设计/C或者C++

随手写的:
main()
{int count[MAXSIZE], curr, i;
while (scanf("%d", &curr) != EOF) count[curr]++;
for (i = 0; i < MAXSIZE; i++)
if (count[i]) printf("%d %d\n", i, count[i]);
return 0;
}