由网友(轻舞飞扬)分享简介：由于输入设置个整数的范围内[0到n ^ 3-1]，提供了一个线性时间排序算法。Given an input set of n integers in the range [0..n^3-1], provide a linear time sorting algorithm.这是我在周四的测试检讨，我不知道如何解决这...

由于输入设置个整数的范围内[0到n ^ 3-1]，提供了一个线性时间排序算法。

Given an input set of n integers in the range [0..n^3-1], provide a linear time sorting algorithm.

这是我在周四的测试检讨，我不知道如何解决这个问题。

This is a review for my test on thursday, and I have no idea how to approach this problem.

推荐答案

另外一起来看看相关的各种过：鸽巢排序或计数排序，还有的基数排序所提到的Pukku。

Also take a look at related sorts too: pigeonhole sort or counting sort, as well as radix sort as mentioned by Pukku.