





def 			lowerCAmelCase_			(				UpperCamelCase_	)  ->		float:
       return -num if num < 0 else num




def 			lowerCAmelCase_			(				UpperCamelCase_	)  ->		int:
       if len(UpperCamelCase_	) == 0:
              raise ValueError("abs_min() arg is an empty sequence"	)
       UpperCamelCase_ 							=	x[0]
       for i in x:
              if abs_val(UpperCamelCase_	) < abs_val(UpperCamelCase_	):
                     UpperCamelCase_ 							=	i
       return j




def 			lowerCAmelCase_			(				UpperCamelCase_	)  ->		int:
       if len(UpperCamelCase_	) == 0:
              raise ValueError("abs_max() arg is an empty sequence"	)
       UpperCamelCase_ 							=	x[0]
       for i in x:
              if abs(UpperCamelCase_	) > abs(UpperCamelCase_	):
                     UpperCamelCase_ 							=	i
       return j




def 			lowerCAmelCase_			(				UpperCamelCase_	)  ->		int:
       if len(UpperCamelCase_	) == 0:
              raise ValueError("abs_max_sort() arg is an empty sequence"	)
       return sorted(UpperCamelCase_       ,		key=UpperCamelCase_	)[-1]




def 			lowerCAmelCase_			(				)  ->		Any:
       assert abs_val(0	) == 0
       assert abs_val(34	) == 34
       assert abs_val(-100000000000	) == 100000000000

       UpperCamelCase_ 							=	[-3, -1, 2, -11]
       assert abs_max(UpperCamelCase_	) == -11
       assert abs_max_sort(UpperCamelCase_	) == -11
       assert abs_min(UpperCamelCase_	) == -1


if __name__ == "__main__":
     import doctest

     doctest.testmod()

     test_abs_val()
     print(abs_val(-3_4))  # --> 34




import functools
from math import sqrt
from time import time



def  snake_case_(_UpperCamelCase					,			*_UpperCamelCase					,			**_UpperCamelCase	)				->      str:



  """simple docstring"""






  _snake_case		=				time()
  _snake_case		=				func(*_UpperCamelCase					,			**_UpperCamelCase	)
  _snake_case		=				time()
  if int(end - start	) > 0:
    print(F"""{func.__name__} runtime: {(end - start):0.4f} s"""	)
  else:
    print(F"""{func.__name__} runtime: {(end - start) * 1_000:0.4f} ms"""	)
  return output



def  snake_case_(_UpperCamelCase	)				->      list[int]:



  """simple docstring"""






  if n < 0:
    raise Exception('''n is negative'''	)
  if n == 0:
    return [0]
  _snake_case		=				[0, 1]
  for _ in range(n - 1	):
    fib.append(fib[-1] + fib[-2]	)
  return fib



def  snake_case_(_UpperCamelCase	)				->      list[int]:



  """simple docstring"""






  def fib_recursive_term(_UpperCamelCase	) -> int:
    if i < 0:
      raise Exception('''n is negative'''	)
    if i < 2:
      return i
    return fib_recursive_term(i - 1	) + fib_recursive_term(i - 2	)

  if n < 0:
    raise Exception('''n is negative'''	)
  return [fib_recursive_term(_UpperCamelCase	) for i in range(n + 1	)]



def  snake_case_(_UpperCamelCase	)				->      list[int]:



  """simple docstring"""






  @functools.cache
  def fib_recursive_term(_UpperCamelCase	) -> int:
    if i < 0:
      raise Exception('''n is negative'''	)
    if i < 2:
      return i
    return fib_recursive_term(i - 1	) + fib_recursive_term(i - 2	)

  if n < 0:
    raise Exception('''n is negative'''	)
  return [fib_recursive_term(_UpperCamelCase	) for i in range(n + 1	)]



def  snake_case_(_UpperCamelCase	)				->      list[int]:



  """simple docstring"""






  if n < 0:
    raise Exception('''n is negative'''	)
  # Cache must be outside recursuive function
  # other it will reset every time it calls itself.
  _snake_case		=				{0: 0, 1: 1, 2: 1}  # Prefilled cache

  def rec_fn_memoized(_UpperCamelCase	) -> int:
    if num in cache:
      return cache[num]

    _snake_case		=				rec_fn_memoized(num - 1	) + rec_fn_memoized(num - 2	)
    _snake_case		=				value
    return value

  return [rec_fn_memoized(_UpperCamelCase	) for i in range(n + 1	)]



def  snake_case_(_UpperCamelCase	)				->      list[int]:



  """simple docstring"""






  if n < 0:
    raise Exception('''n is negative'''	)
  if n >= 1_475:
    raise Exception('''n is too large'''	)
  _snake_case		=				sqrt(5	)
  _snake_case		=				(1 + sqrt_a) / 2
  return [round(phi**i / sqrt_a	) for i in range(n + 1	)]


if __name__ == "__main__":
 __A     						=      30
 time_func(fib_iterative, num)
 time_func(fib_recursive, num)  # Around 3s runtime
 time_func(fib_recursive_cached, num)  # Around 0ms runtime
 time_func(fib_memoization, num)
 time_func(fib_binet, num)

