题目是
Suppose that n numbers are to be sorted, each of which is an integer in the
following interval. Design a linear time algorithm for this problem, or show
that this is impossible.
(a) [0,n-1]
(b) [0,(n,2)-1] (n平方)
(c) [0,(n,3)-1] (n三次方)
不太懂题目要干嘛，不知道怎么下手
是要问说，sort 0~n-1个数可不可能在linear time达到?
那我一开始要怎么下手?
谢谢哦>_<!