How otniel113/padovansequence_dp works
Project type and purpose
• This is a small open-source educational tool (a Python script) that demonstrates three different implementations of the Padovan sequence: purely recursive, DP memoization (top-down), and DP tabulation (bottom-up).
• Its main “use case” is to compute Pₙ for a user-supplied n and compare execution times across the three methods.
File structure
• Top-level:
• README.md – project description, formulas, complexity, charts
• padovan_sequence.py – all of the code (input handling, three algorithms, timing)
• No external frameworks, no database, no web server—just a single Python module.
README for additional insights
• It outlines:
• Three algorithms (with code snippets and recurrence formula)
• Time-complexity for each approach
• Charts showing empirical timing comparisons