Recurrence solver
Skill a5c-ai/babysitter/library/specializations/domains/science/computer-science/skills/recurrence-solver
Solve recurrence relations using multiple methods including Master Theorem and generating functionsFrom its SKILL.md
npx -y skills add a5c-ai/babysitter --skill recurrence-solverAssembled from the repository path, not quoted from the project. Check it against their README if it does not work.
SKILL.md
1.5 KB, 171 tokens by cl100k_base, as published. Nobody here has run it
Recurrence Solver
Purpose
Provides expert guidance on solving recurrence relations arising from divide-and-conquer and recursive algorithm analysis.
Capabilities
- Apply Master Theorem (all three cases)
- Substitution method with guess verification
- Recursion tree analysis with visualization
- Generating functions for complex recurrences
- Akra-Bazzi method for generalized recurrences
- Handle non-standard recurrence forms
Usage Guidelines
- Recognition: Identify recurrence structure and applicable methods
- Master Theorem: Check and apply Master Theorem cases
- Substitution: Formulate and verify guess for complex cases
- Tree Analysis: Build recursion tree for intuition
- Verification: Validate solutions with base cases
Tools/Libraries
- SymPy
- Visualization libraries
- Symbolic algebra systems
What ships with it
Read from the repository
Just SKILL.md. No reference files, no scripts.