suggest
Autocomplete algorithm names by typing a prefix, matching names or words for fast lookup from a Trie-backed index.
Instructions
Autocomplete algorithm names by prefix (Trie-backed typeahead).
Matches the start of the name or any word: 'dij' -> Dijkstra, 'search' -> Binary Search.
Returns up to limit {name, category, path}. Fast O(prefix-length) lookup.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| limit | No | ||
| prefix | Yes | ||
| language | No | python |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |