






def      __lowercase					( snake_case,  snake_case ):







				"""simple docstring"""






				while b:
								__magic_name__     ,				__magic_name__		:str        =      b, a % b
				return a

def      __lowercase					( snake_case,  snake_case ):







				"""simple docstring"""






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

def      __lowercase					( ):







				"""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()














from __future__ import annotations

def      __lowercase					( snake_case,  snake_case ):







				"""simple docstring"""






				__magic_name__		:Tuple        =      0
				__magic_name__		:Tuple        =      len(snake_case ) - 1

				while i < j:
								if nums[i] + nums[j] == target:
												return [i, j]
								elif nums[i] + nums[j] < target:
												__magic_name__		:str        =      i + 1
								else:
												__magic_name__		:List[Any]        =      j - 1

				return []


if __name__ == "__main__":
					import doctest

					doctest.testmod()
					print(f"{two_pointer([2, 7, 11, 15], 9) = }")






