



from __future__ import annotations






def      _A				(UpperCamelCase		:      list )  ->list:



			'''simple docstring'''







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

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

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


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]








def      _A				(UpperCamelCase		:      int      ,			UpperCamelCase		:      int )  ->int:



			'''simple docstring'''







			while b:
						lowerCamelCase__							,lowerCamelCase__ :      int								=		b, a % b
			return a






def      _A				(UpperCamelCase		:      int      ,			UpperCamelCase		:      int )  ->int:



			'''simple docstring'''







			return a if b == 0 else euclidean_gcd_recursive(UpperCamelCase      ,			a % b )






def      _A				()  ->str:



			'''simple docstring'''







			print(f"euclidean_gcd(3, 5) = {euclidean_gcd(3      ,			5 )}" )
			print(f"euclidean_gcd(5, 3) = {euclidean_gcd(5      ,			3 )}" )
			print(f"euclidean_gcd(1, 3) = {euclidean_gcd(1      ,			3 )}" )
			print(f"euclidean_gcd(3, 6) = {euclidean_gcd(3      ,			6 )}" )
			print(f"euclidean_gcd(6, 3) = {euclidean_gcd(6      ,			3 )}" )

			print(f"euclidean_gcd_recursive(3, 5) = {euclidean_gcd_recursive(3      ,			5 )}" )
			print(f"euclidean_gcd_recursive(5, 3) = {euclidean_gcd_recursive(5      ,			3 )}" )
			print(f"euclidean_gcd_recursive(1, 3) = {euclidean_gcd_recursive(1      ,			3 )}" )
			print(f"euclidean_gcd_recursive(3, 6) = {euclidean_gcd_recursive(3      ,			6 )}" )
			print(f"euclidean_gcd_recursive(6, 3) = {euclidean_gcd_recursive(6      ,			3 )}" )


if __name__ == "__main__":
				main()



