Fill the operator combining the two recursive Fibonacci calls.
def fib(n):
if n < 2:
return n
return fib(n - 1) ____ fib(n - 2)
Answer: +
Fibonacci sums the two previous terms.
Play Problem Solving ▸
def fib(n):
if n < 2:
return n
return fib(n - 1) ____ fib(n - 2)
Answer: +