Understanding Recursive Functions in Python: Characteristics, Limits, and a Fibonacci Triangle Exercise

1. Characteristics of recursive functions: they can call themselves and must have at least one exit condition that ends the self‑call.

2. Implementation example: (image showing a sample recursive function).

3. Drawbacks of recursion: it consumes more resources and is often not the first choice; Python's default recursion limit is 1024 calls, after which a RuntimeError: maximum recursion depth exceeded is raised.

Adjusting the limit: Python allows changing the limit, e.g.: import sys # set allowed recursion depth to 2000 sys.setrecursionlimit(2000)

4. Exercise: Write a recursive function that computes the Fibonacci sequence and prints a triangular pattern where each row starts with 0, the number of elements in row n is 2n‑1, and each element is the sum of the two preceding elements in the same row.

Pattern rules:

Each row's first number is 0.

Row n contains 2n‑1 numbers.

Element at position m in row n equals the sum of elements at positions m‑1 and m‑2 in the same row.

Code for the exercise: (image showing the full Python implementation).

Result: (image displaying the output for n = 6, illustrating the Fibonacci triangle).