def counting_sort(my_list):
    if not my_list:
        return my_list
    
    max_val = max(my_list)
    min_val = min(my_list)
    
    range_of_elements = max_val - min_val + 1
    count = [0] * range_of_elements
    output = [0] * len(my_list)
    
    for i in range(len(my_list)):
        count[my_list[i] - min_val] += 1
    
    for i in range(1, len(count)):
        count[i] += count[i - 1]
    
    for i in range(len(my_list) - 1, -1, -1):
        output[count[my_list[i] - min_val] - 1] = my_list[i]
        count[my_list[i] - min_val] -= 1
    
    return output