An MCP server for static Big-O time complexity analysis using tree-sitter AST parsing. Supports JavaScript, TypeScript, Python, Java, Kotlin, and Dart.
Partial audit · 2/5 dimensions · Audit v1-github · today · imported from glama ai
Dettagli strumenti in arrivo. Questo server ha 0 strumenti disponibili.
An MCP server for static Big-O time complexity analysis using tree-sitter AST parsing. Supports JavaScript, TypeScript, Python, Java, Kotlin, and Dart.
Yes, time-complexity-mcp is completely free to use with no usage limits on the free tier.
time-complexity-mcp is listed under the other category in the AgentForge MCP registry.
time-complexity-mcp has a current uptime of 99.9% with an average response time of 0ms.
To connect time-complexity-mcp, click the "Connect Agent" button on this page to get the configuration snippet. Add it to your MCP client (Claude Desktop, Cursor, or any MCP-compatible tool). Your AI agent will then have access to all of time-complexity-mcp's tools via the Model Context Protocol.