Сортировка подсчетом

def countSort(a):
    acc=[]
    for i in range(101):
        acc+=[0]
    for i in a:
        acc[i]+=1
    j=0
    for i in range(101):
        if acc[i]>0:
            for k in range(acc[i]):
                a[j]=i
                j+=1

lst = [0] * 101
for i in map(int, input().split()):
    lst[i] += 1
 
srt = []
for i in range(len(lst)):
    srt.extend([i] * lst[i])
 
print(*srt)

def CountSort(list):
    sortedList = [0] * 101
    for i in list:
        sortedList[i] += 1
    for i in range(101):
        print((str(i) + ' ') * sortedList[i], end='')
 
 
list = [int(i) for i in input().split()]
CountSort(list)

numbers = [int(i) for i in map(int, input().split())]
 
def countSort(nums):
    newlist = []
    while len(nums) != 0:
        newlist.append(min(nums))
        nums.pop(nums.index(min(nums)))
    return newlist
 
 
print(*countSort(numbers))

def countSort(a):
    acc=[]
    for i in range(101):
        acc+=[0]
    for i in a:
        acc[i]+=1
    j=0
    for i in range(101):
        if acc[i]>0:
            for k in range(acc[i]):
                a[j]=i
                j+=1
    return a

x = list(map(int,input().split()))
 
lenght = max(x) + 1
ans = []
 
y = [0] * lenght
 
for i in x:
    y[i] += 1
 
for i in range(lenght):
    if y[i] != 0:
        ans.append(str(i) * y[i])
 
 
print(*ans, sep = " ")