﻿ Python Data Structures and Algorithms - Recursion: Fibonacci sequence - w3resource # 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
else:
return (fibonacci(n - 1) + (fibonacci(n - 2)))

print(fibonacci(7))
```
```

Sample Output:

```13
```

Flowchart: ## 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:

What is the difficulty level of this exercise?

Test your Programming skills with w3resource's quiz.

﻿

## Python: Tips of the Day

Decapitalizes the first letter of a string:

Example:

```def tips_decapitalize(s, upper_rest=False):
return s[:1].lower() + (s[1:].upper() if upper_rest else s[1:])
print(tips_decapitalize('PythonTips'))
print(tips_decapitalize('PythonTips', True))
```

Output:

```pythonTips
pYTHONTIPS
```