Python Data Structures and Algorithms - Recursion: Fibonacci sequence

Python Recursion: Exercise-5 with Solution

Write a Python program to solve the Fibonacci sequence using recursion.

Sample Solution:

Python Code:

def fibonacci(n):
  if n == 1 or n == 2:
    return 1
    return (fibonacci(n - 1) + (fibonacci(n - 2)))


Sample Output:



Flowchart: Recursion: Fibonacci sequence.

Visualize Python code execution:

The following tool visualize what the computer is doing step-by-step as it executes the said program:

Python Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a Python program to get the factorial of a non-negative integer.
Next: Write a Python program to get the sum of a non-negative integer.

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

Follow us on Facebook and Twitter for latest update.

Python: Tips of the Day

Chunks a list into smaller lists of a specified size:


from math import ceil

def tips_chunk(lst, size):
  return list(
    map(lambda x: lst[x * size:x * size + size],
      list(range(0, ceil(len(lst) / size)))))

print(tips_chunk([1, 2, 3, 4, 5, 6], 3))


[[1, 2, 3], [4, 5, 6]]