Posts by Antonio Oliveira • 31 points

• 3

  votes

  4

  answers

  5555

  views

  A: Determine the nth Fibonacci term with recursion

  Recursion is a function that has a defined basis, in the case of Fibonacci it was that fib(1) = 1, and fib(0) = 0, for if n <= 1 , Return n. If the argument passed to the function is not equal to…

  python function recursion

  answered 7 years, 5 months ago Antonio Oliveira 31