Programming Course

Python Course

0.0041 seconds

EN | RU

Implement Data Structures

Problem	Difficulty	Status
Find the N-th Fibonacci Number		Not Completed
Find the N-th Fibonacci Number - Recursive Approach		Not Completed
Reverse a String		Not Completed
Find Maximum in a List		Not Completed
Sum of Elements in a List		Not Completed
Find Duplicates in a List		Not Completed
Merge Two Sorted Lists		Not Completed
Count Frequency of Elements		Not Completed

Question
Clues from AI
Submissions

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...