86 dataS redixSort mit

1.伪代码

//C[i]用于几率出现频率 初始化为0
//initialization
for i <- 1 to k 
	do c[i] = 0 

//counting 递增代表A[j]的计数器的值 
for j <- 1 to n
	do C[A[j]] = C[A[j]] +1 

//summing C[i] 给出数值等于i的元素数量 对前缀做加法 C[i]给出小于等于i的元素数量 
for  i <- 2 to k
	do C[i] <- C[i]+ C[i-1]

//output distribution
for j <- n down to 1 
	do  B[C[A[j]]] <- A[j]
		C[A[j]]  <- A[j]-1