Menu
×
×
Correct!

Exercise:

How can we make this fibonacci() function recursive?

print(0) print(1) count = 2 def fibonacci(prev1, prev2): global count if count <= 19: newFibo = prev1 + prev2 print(newFibo) prev2 = prev1 prev1 = newFibo count += 1 fibonacci(prev1, prev2) else: return fibonacci(1,0)

Not Correct

Click here to try again.

Correct!

Next ❯
print(0)
print(1)
count = 2

def fibonacci(prev1, prev2):
    global count
    if count <= 19:
        newFibo = prev1 + prev2
        print(newFibo)
        prev2 = prev1
        prev1 = newFibo
        count += 1
        (prev1, prev2)
    else:
        return

fibonacci(1,0)

    
  




Log in to keep your progress
Sign up to keep your progress

Completed 0 of 43 Exercises:

DSA Get started
DSA Arrays
DSA Bubble Sort
DSA Selection Sort
DSA Quick Sort
DSA Counting Sort
DSA Radix Sort
DSA Linear Search
DSA Binary Search
DSA Linked Lists
DSA Stacks
DSA Queues
DSA Trees
DSA Binary Trees
DSA Binary Search Trees
DSA AVL Trees
DSA Graphs
DSA Cycle Detection
DSA Dijkstra
DSA Bellman-Ford

×

Reset the Score?

This will reset the score of ALL 43 exercises.

Are you sure you want to continue?



×

Congratulations!

You have finished all 43 DSA exercises.

Share your score: