Babysitter asymptotic-notation-calculator

Automated derivation and simplification of Big-O, Big-Omega, and Big-Theta expressions for algorithm analysis

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/asymptotic-notation-calculator" ~/.claude/skills/a5c-ai-babysitter-asymptotic-notation-calculator && rm -rf "$T"

manifest: library/specializations/domains/science/computer-science/skills/asymptotic-notation-calculator/SKILL.md

Asymptotic Notation Calculator

Purpose

Provides expert guidance on analyzing, simplifying, and comparing asymptotic complexity expressions for algorithm analysis.

Capabilities

Parse and simplify asymptotic expressions
Compare complexity classes
Identify dominant terms
Handle logarithmic, polynomial, and exponential factors
Generate LaTeX-formatted notation
Prove asymptotic relationships

Usage Guidelines

Expression Analysis: Parse complexity expressions into canonical forms
Simplification: Apply dominance rules to simplify nested expressions
Comparison: Determine ordering between complexity classes
Documentation: Generate properly formatted asymptotic notation
Verification: Prove Big-O, Big-Omega, and Big-Theta relationships

Tools/Libraries

SymPy
Symbolic computation
LaTeX rendering