メニュー
Benchmark all sorting algorithm generators: measures step counts and execution time across input sizes and patterns (random, sorted, reverse, duplicates). Use when adding or modifying an algorithm to verify Big-O behaviour.
Codex または Claude でインストール この Prompt をコピーして Codex、Claude、または他のアシスタントに貼り付けると、Skill ページを確認してインストールできます。
SOC 職業分類に基づく
| name | performance-benchmark |
| description | Benchmark all sorting algorithm generators: measures step counts and execution time across input sizes and patterns (random, sorted, reverse, duplicates). Use when adding or modifying an algorithm to verify Big-O behaviour. |
| user-invocable | true |
Runs all algorithm generators across multiple input sizes and patterns, outputting step counts and timing.
Run the benchmark:
npx tsx .github/skills/performance-benchmark/scripts/benchmark.ts
Review the output table showing step counts per algorithm × input pattern × size
Cross-reference against complexity-expectations.md to verify that step counts are within expected ranges
compare count significantly above the expected range indicates a bugRun an axe-core accessibility audit across all algorithm visualizer routes. Use before any release to verify WCAG 2.1 AA compliance, especially after UI or animation changes.
Run a pre-deploy smoke test: builds the app, starts wrangler pages dev, and verifies every algorithm route loads and the visualizer renders correctly. Run before pushing to main.
Scaffold a new sorting algorithm: generates the generator file, pure sort function, and Vitest test file from templates, then registers it in the index and constants. Use when adding any new sorting algorithm to the project.
Capture and compare visual screenshots of the sorting visualizer. Use before/after animation changes, styling updates, or any UI refactors to detect unintended regressions.