Programming Course

Python Course

0.0060 seconds

EN | RU

Python Course

Problem	Difficulty	Status

Question
Clues from AI

Find the N-th Fibonacci Number - Recursive Approach

The Fibonacci sequence can also be implemented recursively. Your task is to write a function (def getNthFibRecursive(n)) that returns the N-th Fibonacci number using recursion.

main.py

                            def getNthFibRecursive(n):
    if n == 1:
        return 0
    elif n == 2:
        return 1
    else:
        return getNthFibRecursive(n - 1) + getNthFibRecursive(n - 2)

print(getNthFibRecursive(8))
                        
                                Running...