



'''simple docstring'''





def 			a_	(				_lowerCAmelCase			,_lowerCAmelCase			) -> float:
  return base * power(_lowerCAmelCase			,(exponent - 1)			) if exponent else 1


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











'''simple docstring'''





from __future__ import annotations

_UpperCamelCase											=		10

def 			a_	(				_lowerCAmelCase			) -> list[int]:
  __lowerCamelCase			:			str       			=					1
  __lowerCamelCase			:			Union[str, Any]       			=					max(_lowerCAmelCase			)
  while placement <= max_digit:
    # declare and initialize empty buckets
    __lowerCamelCase			:			list[list]       			=					[[] for _ in range(_lowerCAmelCase			)]
    # split list_of_ints between the buckets
    for i in list_of_ints:
      __lowerCamelCase			:			List[str]       			=					int((i / placement) % RADIX			)
      buckets[tmp].append(_lowerCAmelCase			)
    # put each buckets' contents into list_of_ints
    __lowerCamelCase			:			Dict       			=					0
    for b in range(_lowerCAmelCase			):
      for i in buckets[b]:
        __lowerCamelCase			:			List[str]       			=					i
        a += 1
        # move to next
    placement *= RADIX
  return list_of_ints


if __name__ == "__main__":
   import doctest

   doctest.testmod()






