Gabriel Donnan gabedonnan
gabedonnan
/ example.py
Last active
September 3, 2025 07:08
A simple python decorator to track the calls of a decorated function, including generating a tree of it's recursive calls, tracking time taken for execution and memory allocated.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| from tracing import Tracker | |
| @Tracker | |
| def recur_fibo(n): | |
| # Simple recursive fibbonacci program found on stackoverflow for testing | |
| if n <= 1: | |
| return n | |
| else: | |
| return recur_fibo(n-1) + recur_fibo(n-2) |