

import numpy as np





def a(lowercase__      ,			lowercase__      ,			lowercase__      ,			lowercase__      ,			lowercase__						):





	'''simple docstring'''
	snake_case_   		=			int(np.ceil((x_end - xa) / h						)						)
	snake_case_   		=			np.zeros((n + 1,)						)
	snake_case_   		=			ya
	snake_case_   		=			xa

	for k in range(lowercase__						):
		snake_case_   		=			f(lowercase__      ,			y[k]						)
		snake_case_   		=			f(x + 0.5 * h      ,			y[k] + 0.5 * h * ka						)
		snake_case_   		=			f(x + 0.5 * h      ,			y[k] + 0.5 * h * ka						)
		snake_case_   		=			f(x + h      ,			y[k] + h * ka						)
		snake_case_   		=			y[k] + (1 / 6) * h * (ka + 2 * ka + 2 * ka + ka)
		x += h

	return y


if __name__ == "__main__":
		import doctest

		doctest.testmod()



def a(lowercase__						):





	'''simple docstring'''
	snake_case_   		=			len(lowercase__						)
	for _ in range(lowercase__						):
		for i in range(_ % 2      ,			arr_size - 1      ,			2						):
			if arr[i + 1] < arr[i]:
				snake_case_		,							snake_case_   		=			arr[i + 1], arr[i]

	return arr


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