Asymptotic notation calculator
Automated derivation and simplification of Big-O, Big-Omega, and Big-Theta expressions for algorithm analysisFrom its SKILL.md
npx -y skills add a5c-ai/babysitter --skill asymptotic-notation-calculatorAssembled from the repository path, not quoted from the project. Check it against their README if it does not work.
SKILL.md
1.5 KB, 172 tokens by cl100k_base, as published. Nobody here has run it
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
What ships with it
Read from the repository
Just SKILL.md. No reference files, no scripts.