def counting_sort(my_list):
    if not my_list:
        return []
    min_val = min(my_list)
    max_val = max(my_list)
    count = [0] * (max_val - min_val + 1)
    for num in my_list:
        count[num - min_val] += 1
    result = []
    for i, c in enumerate(count):
        if c:
            result.extend([i + min_val] * c)
    return result