排序算法与文件倒排索引.ppt

* COUNTING-SORT(A, B, k) 1 (for i 0 to k) do C[i] 0 //initialize C[i] 2 (for j 1 to length[A] ) do C[A[j]] C[A[j]] + 1 //C[i] now contains the number of elements equal to i. 3 (for i 1 to k) do C[i] C