Distribution counting sort:分布计数排序
Algorithm D
Algorithm D (Distribution counting). Assuming that all keys are integers in
the range u<=Kj<=v for 1<j<N , this algorithm sorts the records R1,...,RN
by making use of an auxiliary table COUNT[u],...,COUNT[v] . At the conclusion
of the algorithm the records are moved to an output area S