

'''simple docstring'''



def       snake_case   (	snake_case      : int					,		snake_case      : int			) ->  float:


    """simple docstring"""


    return base * power(snake_case					,		(exponent - 1)			) if exponent else 1


if __name__ == "__main__":
     print("Raise base to the power of exponent using recursion...")
     _UpperCamelCase						:  str							       =				int(input("Enter the base: ").strip())
     _UpperCamelCase						:  List[str]							       =				int(input("Enter the exponent: ").strip())
     _UpperCamelCase						:  str							       =				power(base, abs(exponent))
     if exponent < 0:  # power() does not properly deal w/ negative exponents
          _UpperCamelCase						:  Optional[Any]							       =				1 / result
     print(F"""{base} to the power of {exponent} is {result}""")








'''simple docstring'''



def       snake_case   (	snake_case      : list			) ->  list:


    """simple docstring"""


    if any(not isinstance(snake_case					,		snake_case			) or x < 0 for x in sequence			):
        raise TypeError('Sequence must be list of non-negative integers'			)
    for _ in range(len(snake_case			)			):
        for i, (rod_upper, rod_lower) in enumerate(zip(snake_case					,		sequence[1:]			)			):
            if rod_upper > rod_lower:
                sequence[i] -= rod_upper - rod_lower
                sequence[i + 1] += rod_upper - rod_lower
    return sequence


if __name__ == "__main__":
     assert bead_sort([5, 4, 3, 2, 1]) == [1, 2, 3, 4, 5]
     assert bead_sort([7, 9, 4, 3, 5]) == [3, 4, 5, 7, 9]





