'''simple docstring'''




def __lowerCAmelCase (							UpperCamelCase__				)	->    list:
    __lowerCamelCase		=  len(UpperCamelCase__				)
    for _ in range(UpperCamelCase__				):
        for i in range(_ % 2				,  arr_size - 1				,  2				):
            if arr[i + 1] < arr[i]:
                __lowerCamelCase	,  __lowerCamelCase		=  arr[i + 1], arr[i]

    return arr


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







from heapq import heappop, heappush

import numpy as np







def  _SCREAMING_SNAKE_CASE				(   a					,						a					,						a					,						a					,						)      ->      tuple[float | int, list[tuple[int, int]]]:
					__A    ,				__A	:						int       =				grid.shape
					__A	:						Any       =				[-1, 1, 0, 0]
					__A	:						Optional[Any]       =				[0, 0, -1, 1]
					if allow_diagonal:
										dx += [-1, -1, 1, 1]
										dy += [-1, 1, -1, 1]

					__A    ,				__A	:						Optional[int]       =				[(0, source)], set()
					__A	:						Any       =				np.full((rows, cols)					,						np.inf  )
					__A	:						Any       =				0
					__A	:						Any       =				np.empty((rows, cols)					,						dtype=a  )
					__A	:						Optional[Any]       =				None

					while queue:
										((__A)    ,				(__A))	:						List[str]       =				heappop(a  )
										if (x, y) in visited:
															continue
										visited.add((x, y)  )

										if (x, y) == destination:
															__A	:						int       =				[]
															while (x, y) != source:
																				path.append((x, y)  )
																				__A    ,				__A	:						Optional[int]       =				predecessors[x, y]
															path.append(a  )  # add the source manually
															path.reverse()
															return matrix[destination], path

										for i in range(len(a  )  ):
															__A    ,				__A	:						Union[str, Any]       =				x + dx[i], y + dy[i]
															if 0 <= nx < rows and 0 <= ny < cols:
																				__A	:						Optional[int]       =				grid[nx][ny]
																				if next_node == 1 and matrix[nx, ny] > dist + 1:
																									heappush(a					,						(dist + 1, (nx, ny))  )
																									__A	:						List[Any]       =				dist + 1
																									__A	:						Union[str, Any]       =				(x, y)

					return np.inf, []


if __name__ == "__main__":
				import doctest

				doctest.testmod()




