def ram_killer_sort(l):
    """
    A sorting function that sorts in O(size_of_list + highest_number_in_list) and only works with natural numbers.
    This sort sacrifices your space complexity however, which is O(highest_number_in_list).
    """
    assert all(map(lambda x:x%1==0and x>=0, l)) # O(n)
    r = [""] * (max(l) + 1) # O(n + m) where m is highest item in list
    for item in l:
        r[item] += f"{item}\n" # O(n)
    return [*map(int, "".join(r).split("\n")[:-1])] # O(n + m) where m is highest item in list

def ticksort(l):
    ll = l.copy()
    r = []
    c = 0
    while True:
        c += 1
        e = 0
        for i in range(len(ll)):
            ll[i-e] -= 1
            if ll[i-e] <= 0:
                r.append(ll[i-e] + c)
                ll.remove(ll[i-e])
                e += 1
        if ll == []:
            break
    return r

TEST_CASE = [7, 11, 5, 2, 3, 0]
print(ticksort(TEST_CASE))

"""
"""