How does it help with PHP memory management?

The skill analyzes space complexity and suggests memory-efficient patterns, such as replacing large result arrays with PHP Generators (yield) or avoiding O(n²) space matrix allocations.

Can I use it to scan large PHP projects?

The skill includes specific Grep patterns designed to help you quickly locate high-risk code structures across entire directories and multi-file projects.

What PHP patterns does this skill detect?

It identifies common bottlenecks including nested loops, exponential recursion (like naive Fibonacci), inefficient string concatenation, array_unshift operations in loops, and linear searches that could be optimized with indexing.

Does it provide optimized code examples?

Yes, for every complexity issue detected, it provides a side-by-side comparison of the current implementation versus an optimized version, including projected performance gains.

PHP Algorithm Complexity Estimator

Name: PHP Algorithm Complexity Estimator
Author: dykyi-roman

bydykyi-roman

•

Developer Tools

Analyzes PHP code to estimate time and space complexity and identifies performance bottlenecks like O(n²) patterns.

This skill empowers Claude to perform deep static analysis on PHP codebases to identify algorithmic inefficiencies that lead to performance degradation. It systematically detects high-complexity patterns—such as nested loops, exponential recursion, and inefficient string or array operations—while providing immediate, production-ready optimization suggestions. By classifying issues by severity and calculating the theoretical performance impact for varying dataset sizes, it serves as an essential tool for developers refactoring legacy code or building high-scale PHP applications.

Key Features

01Includes specialized Grep patterns for rapid codebase-wide scanning of complexity risks

0245 GitHub stars

03Identifies inefficient native PHP operations like string concatenation and array_merge in loops

04Provides optimized code alternatives using hash sets, generators, and indexed lookups

05Estimates both time and space complexity with a standardized severity classification

06Detects O(n²) and O(2^n) patterns in PHP loops and recursive functions

Use Cases

01Identifying performance bottlenecks in legacy PHP applications before infrastructure scaling

02Reducing application memory footprints by converting large array transformations into PHP Generators

03Optimizing backend API response times by replacing linear searches with hash-based indexing

What are Skills?·How to Install

Install with 🐟 Skill.Fish

npx skillfish add dykyi-roman/awesome-claude-code estimate-complexity

For use in Claude.ai and ChatGPT

Download Skill