代码如下:
# -*- coding:utf-8 -*-
# python实现计数排序
def CountingSort(L, M, k):
C = []
for i in range(k+1):
C.append(0) #C列表表示的是在列表L中各个元素的个数
for j in range(len(L)):
C[L[j]] = C[L[j]] + 1
M.append(0)
for i in range(1,k+1):
C[i] = C[i] + C[i-1] #此步是得出L中小于其中某个值的个数
for j in range(len(L)):
M[C[L[j]]-1] = L[j] #M列表表示的是排序后的列表
C[L[j]] = C[L[j] ] - 1
if __name__ == '__main__':
M = []
li = [6,0,2,0,1,3,4,6,1,3,2]
CountingSort(li, M, 30)
print M