Stats
Actions
Tags
From algo-math-structurer
Analyze time and space complexity of a Python algorithm. Produces Big-O analysis with derivation.
How this command is triggered — by the user, by Claude, or both
Slash command
/algo-math-structurer:analyze-complexityThe summary Claude sees in its command listing — used to decide when to auto-load this command
# /algo-math:analyze-complexity Analyze the time and space complexity of a Python algorithm. ## Parameters - `code` (required): Python algorithm code to analyze ## Workflow 1. Receive Python algorithm code from user 2. Invoke the `algorithm-formalization` skill to: - Identify loops, recursion, and control flow - Derive recurrence relations if applicable - Apply Master theorem for divide-and-conquer - Compute Big-O time and space complexity 3. Generate a focused LaTeX document with complexity analysis only 4. Compile to PDF and return the path ## References - Core skill: `sk...
Analyze the time and space complexity of a Python algorithm.
code (required): Python algorithm code to analyzealgorithm-formalization skill to:
skills/algorithm-formalization/SKILL.mdskills/algorithm-formalization/references/proof-patterns.md (Complexity Analysis section)/algo-math:analyze-complexity
Then paste your Python algorithm code.
npx claudepluginhub baptistecaille/research-plugin --plugin algo-math-structurer/analyze-complexityAnalyzes project tasks for complexity (technical, time, deps, risks), scores 1-10, flags high-risk ones, and recommends expansions/subtasks. Supports --research and --threshold flags.
/analyze-complexityCalculates cyclomatic and cognitive complexity across source files, ranks top complex functions and files, benchmarks against standards, and suggests refactoring strategies.