



def 						UpperCamelCase      (  snake_case__			:       list      )      ->	list:
   UpperCamelCase       :    str		      =      len(snake_case__      )
   for _ in range(snake_case__      ):
      for i in range(_ % 2			,	arr_size - 1			,	2      ):
         if arr[i + 1] < arr[i]:
            UpperCamelCase      ,	UpperCamelCase       :    Optional[Any]		      =      arr[i + 1], arr[i]

   return arr


if __name__ == "__main__":
    __UpperCAmelCase			  =			list(range(10, 0, -1))
    print(F"""Original: {arr}. Sorted: {odd_even_transposition(arr)}""")








"""simple docstring"""

def  __snake_case							(	__A      :						list							,		__A      :						int							,		__A      :						int = 0							,		__A      :						int = 0     )     ->       int:






				'''simple docstring'''
				SCREAMING_SNAKE_CASE						:							Any							=     right or len(__A     ) - 1
				if left > right:
								return -1
				elif list_data[left] == key:
								return left
				elif list_data[right] == key:
								return right
				else:
								return search(__A							,		__A							,		left + 1							,		right - 1     )


if __name__ == "__main__":
							import doctest

							doctest.testmod()





