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