OpenSkillIndex← back to search
claude-codescience

Babysitter recurrence-solver

Solve recurrence relations using multiple methods including Master Theorem and generating functions

install
source · Clone the upstream repo
git clone https://github.com/a5c-ai/babysitter
Claude Code · Install into ~/.claude/skills/
T=$(mktemp -d) && git clone --depth=1 https://github.com/a5c-ai/babysitter "$T" && mkdir -p ~/.claude/skills && cp -r "$T/library/specializations/domains/science/computer-science/skills/recurrence-solver" ~/.claude/skills/a5c-ai-babysitter-recurrence-solver && rm -rf "$T"
manifest: library/specializations/domains/science/computer-science/skills/recurrence-solver/SKILL.md
tags
#recurrence-analysis#algorithm-design#math-solver#complexity-analysis#symbolic-math
source content

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

  1. Recognition: Identify recurrence structure and applicable methods
  2. Master Theorem: Check and apply Master Theorem cases
  3. Substitution: Formulate and verify guess for complex cases
  4. Tree Analysis: Build recursion tree for intuition
  5. Verification: Validate solutions with base cases

Tools/Libraries

  • SymPy
  • Visualization libraries
  • Symbolic algebra systems