Skip to main content
Glama

Algorithm Find

algorithm_find
Read-onlyIdempotent

Which algorithm, data structure or technique fits a computational problem. Describe the problem in words ("shortest route between two points with positive costs", "assign workers to jobs minimising cost", "find near-duplicate records", "schedule jobs to minimise lateness") and get the standard textbook methods (preconditions, worst-case / expected / amortized bounds, when to use and when not, alternatives, each fact cited to CLRS and other textbooks and to the NIST Dictionary of Algorithms and Data Structures), the open questions whose answers decide between them, Skiena Algorithm Repository problem pages, and recent research papers with dates from Hugging Face Papers and arXiv. want=common for textbook only, novel for recent papers only.

Input Schema

NameRequiredDescriptionDefault
wantNocommon = textbook methods; novel = recent research papers; both (default).
limitNoMax results per leg (1-25, default 8).
problemYesThe computational problem in plain words, e.g. "all-pairs shortest paths", "approximate nearest neighbor search in high dimensions", "longest common subsequence of two strings".
since_yearNoEarliest publication year for novel results (default: five years ago).
constraintsNoOptional facts about your instance (same keys as algorithm_compare, e.g. {"negative_weights": true}); textbook results that violate one move to the end and each result carries a per-constraint fit.

Schema Changelog

Changes observed during successful MCP inspections.

  1. First observed

TDQS

A3.7/5.0
Behavior4/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

Annotations already declare readOnly/idempotent/openWorld/no-destroy, so the safety profile is covered. The description adds real behavioral context beyond that: the sources consulted (CLRS, NIST DADS, Skiena repository, HF Papers, arXiv), that results carry citations and dates, and that recent papers are date-filtered. It stops short of describing result counts, ordering, or how the two legs are merged.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness4/5

Is the description appropriately sized, front-loaded, and free of redundancy?

The purpose is front-loaded in the first clause and the remaining text is dense, information-bearing content (outputs, sources, want semantics) rather than padding. It is a long single block, but for a complex research-style tool every sentence contributes and nothing is wasted.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness4/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

For a complex, open-world tool with a nested constraints object and no output schema, the description covers what is returned (methods, bounds, citations, papers) and the want behavior. The constraints-fitting behavior is only in the schema, and result ordering/counts are unstated, but the agent has enough to call it correctly.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters3/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

Schema coverage is 100%, so the schema already documents all five parameters including enum values and defaults. The description mostly restates want (common vs novel) and repeats example problem strings, adding only marginal meaning beyond what the schema provides. Baseline 3 is appropriate.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose4/5

Does the description clearly state what the tool does and how it differs from similar tools?

States a specific verb and resource: given a problem described in words, find algorithms/data structures/techniques that fit. The detailed output list (textbook methods, bounds, Skiena pages, arXiv/HF papers) makes the tool's role unambiguous. It does not name sibling tools (algorithm_lookup, algorithm_compare, algorithm_implementations) to draw the boundary, so it falls short of a 5.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines3/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

It explains how to invoke the tool (describe the problem in plain words, with four illustrative examples) and clarifies the want flag semantics. However there is no explicit when-not guidance and no routing to the closely-related siblings, leaving the agent to infer when algorithm_find is preferable to algorithm_lookup or algorithm_compare.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.

Try in Browser

Glama MCP Gateway

Add one secure layer between your agents and this server.