Algorithm Find
algorithm_findRead-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
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| want | No | common = textbook methods; novel = recent research papers; both (default). | |
| limit | No | Max results per leg (1-25, default 8). | |
| problem | Yes | The 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_year | No | Earliest publication year for novel results (default: five years ago). | |
| constraints | No | Optional 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. |