






'''simple docstring'''







from __future__ import annotations





def  SCREAMING_SNAKE_CASE_       (UpperCamelCase				,			UpperCamelCase				,			UpperCamelCase				,			UpperCamelCase      )      ->       None:
							if (direction == 1 and array[indexa] > array[indexa]) or (
							    direction == 0 and array[indexa] < array[indexa]
							):
														lowerCamelCase__  ,		lowerCamelCase__					:	List[Any]         =       array[indexa], array[indexa]





def  SCREAMING_SNAKE_CASE_       (UpperCamelCase				,			UpperCamelCase				,			UpperCamelCase				,			UpperCamelCase      )      ->       None:
							if length > 1:
														lowerCamelCase__					:	Optional[Any]         =       int(length / 2      )
														for i in range(UpperCamelCase				,			low + middle      ):
																					comp_and_swap(UpperCamelCase				,			UpperCamelCase				,			i + middle				,			UpperCamelCase      )
														bitonic_merge(UpperCamelCase				,			UpperCamelCase				,			UpperCamelCase				,			UpperCamelCase      )
														bitonic_merge(UpperCamelCase				,			low + middle				,			UpperCamelCase				,			UpperCamelCase      )





def  SCREAMING_SNAKE_CASE_       (UpperCamelCase				,			UpperCamelCase				,			UpperCamelCase				,			UpperCamelCase      )      ->       None:
							if length > 1:
														lowerCamelCase__					:	Tuple         =       int(length / 2      )
														bitonic_sort(UpperCamelCase				,			UpperCamelCase				,			UpperCamelCase				,			1      )
														bitonic_sort(UpperCamelCase				,			low + middle				,			UpperCamelCase				,			0      )
														bitonic_merge(UpperCamelCase				,			UpperCamelCase				,			UpperCamelCase				,			UpperCamelCase      )


if __name__ == "__main__":
			_A	:			List[str]         =input('''Enter numbers separated by a comma:\n''').strip()
			_A	:			List[str]         =[int(item.strip()) for item in user_input.split(''',''')]

			bitonic_sort(unsorted, 0, len(unsorted), 1)
			print('''\nSorted array in ascending order is: ''', end='''''')
			print(*unsorted, sep=''', ''')

			bitonic_merge(unsorted, 0, len(unsorted), 0)
			print('''Sorted array in descending order is: ''', end='''''')
			print(*unsorted, sep=''', ''')









'''simple docstring'''







def  SCREAMING_SNAKE_CASE_       (UpperCamelCase				,			UpperCamelCase      )      ->       int:
							return abs(UpperCamelCase      ) if a == 0 else greatest_common_divisor(b % a				,			UpperCamelCase      )





def  SCREAMING_SNAKE_CASE_       (UpperCamelCase				,			UpperCamelCase      )      ->       int:
							while y:  # --> when y=0 then loop will terminate and return x as final GCD.
														lowerCamelCase__  ,		lowerCamelCase__					:	Tuple         =       y, x % y
							return abs(UpperCamelCase      )





def  SCREAMING_SNAKE_CASE_       ()      ->       Tuple:
							try:
														lowerCamelCase__					:	Dict         =       input("""Enter two integers separated by comma (,): """      ).split(""","""      )
														lowerCamelCase__					:	Any         =       int(nums[0]      )
														lowerCamelCase__					:	Optional[Any]         =       int(nums[1]      )
														print(
														    f'''greatest_common_divisor({num_a}, {num_a}) = '''
														    f'''{greatest_common_divisor(UpperCamelCase				,			UpperCamelCase      )}'''      )
														print(f'''By iterative gcd({num_a}, {num_a}) = {gcd_by_iterative(UpperCamelCase				,			UpperCamelCase      )}'''      )
							except (IndexError, UnboundLocalError, ValueError):
														print("""Wrong input"""      )


if __name__ == "__main__":
			main()

