






from __future__ import annotations


def   _A   (				SCREAMING_SNAKE_CASE__  :	list       ):




    if len(lowerCAmelCase__       ) == 0:
        return []
    UpperCamelCase       :int								=   min(lowerCAmelCase__       ), max(lowerCAmelCase__       )
    UpperCamelCase       :List[Any]								=   int(max_value - min_value       ) + 1
    UpperCamelCase       :list[list]								=   [[] for _ in range(lowerCAmelCase__       )]

    for i in my_list:
        buckets[int(i - min_value       )].append(lowerCAmelCase__       )

    return [v for bucket in buckets for v in sorted(lowerCAmelCase__       )]


if __name__ == "__main__":
 from doctest import testmod

 testmod()
 assert bucket_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
 assert bucket_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]










"""simple docstring"""







def 				UpperCamelCase_    (    lowerCAmelCase__      :				int = 100						)						->   int:

  """simple docstring"""




  lowerCAmelCase_   :				Any								= (n * (n + 1) // 2) ** 2
  lowerCAmelCase_   :				Optional[int]								= n * (n + 1) * (2 * n + 1) // 6
  return sum_cubes - sum_squares


if __name__ == "__main__":
     print(f'{solution() = }')





