Complexity Analyzer

---
name: complexity-analyzer
description: Rank functions/files by structural complexity (branching, nesting, length) combined with churn (how often they change) to prioritize refactoring effort. Use when asked to find "the worst code" or prioritize cleanup, not for a single-file review.
---

# Complexity Analyzer

## Signal 1: structural complexity

For each function, estimate (don't need to be exact):
- Branch count (if/else, switch/match, ternary, loop conditions, `&&`/`||`
  short-circuits used as control flow).
- Max nesting depth.
- Length in lines, as a tiebreaker only -- a long function with no
  branching (e.g. a data literal) is not complex.

## Signal 2: churn

`git log --format=%H -- <path>` (or per-function if the tool supports it)
to count how many commits touched the file in a recent window (e.g. last 6
months). A complex function nobody touches is stable risk; a complex
function that changes every week is where bugs are actually born.

## Combine and rank

Complexity x churn, roughly -- a function that's both tangled and
frequently edited outranks one that's tangled but frozen. Present as a
ranked list, top 10-15, not an exhaustive audit of the whole repo.

## Output format

Table: function/file, complexity estimate, recent commit count, one-line
reason it made the list. End with which 2-3 are worth tackling first and
why (usually: highest churn among the high-complexity set).