计数排序:
def counting_sort(a, k):
n = len(a)
b = [0 for i in range(n)]
c = [0 for i in range(k + 1)]
for j in a:
c[j] = c[j] + 1
for i in range(1, len(c)):
c[i] = c[i] + c[i-1]
for j in a:
b[c[j] - 1] = j
c[j] = c[j] - 1
return b