搜索资源列表
distsort
- 该程序是分布计数排序,它是我所见过的各种排序方法中最快的,它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限,并且如果上限与下限的差值比较大的话,空间消耗也比较大.-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it's time complexity of O (n), but this sort known to be