Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx skills add Tyler-R-Kendrick/agent-skills --skill algorithmsgit clone --depth 1 https://github.com/Tyler-R-Kendrick/agent-skillsWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/skills/tyler-r-kendrick/agent-skills/algorithms)<a href="https://agentmods.dev/skills/tyler-r-kendrick/agent-skills/algorithms"><img src="https://agentmods.dev/badge/skills/tyler-r-kendrick/agent-skills/algorithms/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/skills/tyler-r-kendrick/agent-skills/algorithms"><img src="https://agentmods.dev/badge/skills/tyler-r-kendrick/agent-skills/algorithms.svg" alt="Reviewed on agentmods" width="80" height="20"></a>What it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5.1 | $0.00105 | $0.01668 |
| Opus 5.5 | $0.00042 | $0.00667 |
| Sonnet 5.5 | $0.00021 | $0.00334 |
| Haiku 4.5 | $0.00011 | $0.00167 |
Grade A, and why
algorithms scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 2mo ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
How it starts
The opening of the file, as written. The whole thing — 120 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Algorithms & Data Structures
Overview
This skill covers the foundational principles of algorithmic thinking, drawn primarily from Donald Knuth's The Art of Computer Programming (TAOCP). It provides guidance on analyzing algorithm efficiency, understanding complexity classes, and choosing the right algorithmic approach for a given problem.
Canonical Reference
| Volume | Title | Covers |
|---|---|---|
| TAOCP Vol. 1 | Fundamental Algorithms | Data structures, mathematical foundations, information structures |
| TAOCP Vol. 2 | Seminumerical Algorithms | Random numbers, arithmetic, floating-point |
| TAOCP Vol. 3 | Sorting and Searching | Sorting, searching, comparison of methods |
| TAOCP Vol. 4A | Combinatorial Algorithms, Part 1 | Combinatorial generation, backtracking, constraint satisfaction |
| TAOCP Vol. 4B | Combinatorial Algorithms, Part 2 | Satisfiability, graph algorithms |
Big-O Notation
Big-O describes the upper bound of an algorithm's growth rate as input size increases. It characterizes the worst-case behavior and allows comparison between algorithms independent of hardware.
Common Complexity Classes
| Notation | Name | Example |
|---|---|---|
| O(1) | Constant | Hash table lookup, array index access |
| O(log n) | Logarithmic | Binary search, balanced BST lookup |
| O(n) | Linear | Linear search, single array traversal |
| O(n log n) | Linearithmic | Mergesort, Heapsort, efficient comparison sorts |
| O(n^2) | Quadratic | Bubble sort, insertion sort (worst case), nested loops |
| O(2^n) | Exponential | Recursive Fibonacci (naive), subset enumeration |
Growth Rate Comparison
n O(1) O(log n) O(n) O(n log n) O(n^2) O(2^n)
1 1 0 1 0 1 2
10 1 3.3 10 33 100 1,024
100 1 6.6 100 664 10,000 ~1.27 x 10^30
1,000 1 10 1,000 10,000 1,000,000 ~1.07 x 10^301
10,000 1 13.3 10,000 133,000 100,000,000 (infeasible)
What ships with it
60 files beside SKILL.md in the same directory: the scripts, references and assets a skill reads on demand. Not counted in the per-session cost; read them before you install if any of them is executable.
- AGENTS.md 6.2 KB
- combinatorial/AGENTS.md 10 KB
- combinatorial/metadata.json 847 B
- combinatorial/README.md 732 B
- combinatorial/rules/_sections.md 1.6 KB
- combinatorial/rules/_template.md 372 B
- combinatorial/rules/combinatorial-always-add-pruning-to-backtracking-even-simple.md 458 B
- combinatorial/rules/combinatorial-choose-variable-and-value-ordering-heuristics-carefully.md 456 B
- combinatorial/rules/combinatorial-consider-whether-the-problem-has-symmetries-that-can-be.md 461 B
- combinatorial/rules/combinatorial-for-optimization-problems-consider-branch-and-bound-before.md 435 B
- combinatorial/rules/combinatorial-for-problems-with-overlapping-subproblems-e.md 426 B
- combinatorial/rules/combinatorial-reference-knuth-s-taocp-vol.md 472 B
- combinatorial/rules/combinatorial-use-constraint-propagation-forward-checking-arc.md 438 B
- combinatorial/SKILL.md 11 KB
- data-structures/AGENTS.md 8.7 KB
- data-structures/metadata.json 814 B
- data-structures/README.md 726 B
- data-structures/rules/_sections.md 1.3 KB
- data-structures/rules/_template.md 374 B
- data-structures/rules/data-structures-choose-the-data-structure-based-on-the-dominant-operation.md 470 B
- data-structures/rules/data-structures-consider-cache-locality.md 451 B
- data-structures/rules/data-structures-for-concurrent-access-consider-concurrent-variants.md 447 B
- data-structures/rules/data-structures-prefer-standard-library-implementations-they-are.md 456 B
- data-structures/rules/data-structures-reference-knuth-s-taocp-vol.md 451 B
- data-structures/rules/data-structures-remember-that-theoretical-complexity-is-not-the-full-story.md 514 B
- data-structures/SKILL.md 9.7 KB
- dynamic-programming/AGENTS.md 8.9 KB
- dynamic-programming/metadata.json 838 B
- dynamic-programming/README.md 772 B
- dynamic-programming/rules/_sections.md 1.6 KB
- dynamic-programming/rules/_template.md 378 B
- dynamic-programming/rules/dynamic-programming-always-verify-optimal-substructure-before-applying-dp.md 510 B
- dynamic-programming/rules/dynamic-programming-consider-whether-the-problem-admits-a-greedy-solution.md 428 B
- dynamic-programming/rules/dynamic-programming-define-your-state-precisely-and-minimally-extra-state.md 434 B
- dynamic-programming/rules/dynamic-programming-for-interview-competition-settings-practice-identifying.md 476 B
- dynamic-programming/rules/dynamic-programming-reference-knuth-s-taocp-for-mathematical-rigor-on-sequence.md 495 B
- dynamic-programming/rules/dynamic-programming-validate-your-recurrence-with-small-examples-before-coding.md 423 B
- dynamic-programming/SKILL.md 9.9 KB
- graph-algorithms/AGENTS.md 8.8 KB
- graph-algorithms/metadata.json 845 B
- graph-algorithms/README.md 752 B
- graph-algorithms/rules/_sections.md 1.5 KB
- graph-algorithms/rules/_template.md 375 B
- graph-algorithms/rules/graph-algorithms-always-choose-the-simplest-algorithm-that-handles-your.md 525 B
- graph-algorithms/rules/graph-algorithms-consider-whether-the-graph-is-a-dag-many-problems.md 478 B
- graph-algorithms/rules/graph-algorithms-for-a-invest-time-in-designing-a-good-heuristic-the.md 436 B
- graph-algorithms/rules/graph-algorithms-for-sparse-graphs-adjacency-list-representation-is-almost.md 505 B
- graph-algorithms/rules/graph-algorithms-reference-knuth-s-taocp-for-rigorous-mathematical-analysis.md 454 B
- graph-algorithms/rules/graph-algorithms-when-implementing-kruskal-s-always-use-union-find-with.md 462 B
- graph-algorithms/SKILL.md 9.8 KB
- metadata.json 783 B
- README.md 1.6 KB
- rules/_sections.md 1.2 KB
- rules/_template.md 369 B
- rules/algorithms-know-the-standard-library-most-languages-provide.md 395 B
- rules/algorithms-prefer-algorithms-with-good-average-case-behavior-for.md 421 B
- rules/algorithms-reference-knuth-s-taocp-for-rigorous-analysis-and.md 367 B
- rules/algorithms-start-with-the-simplest-correct-algorithm-then-optimize-if.md 378 B
- rules/algorithms-understand-amortized-costs-before-concluding-that-an.md 377 B
- sorting-searching/AGENTS.md 8.8 KB
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 2mo ago First seen · 120 lines · 105 tokens per session scan A c21244bb95c6
algorithms is a skill published in the GitHub repository Tyler-R-Kendrick/agent-skills (13 stars, last pushed 5mo ago), licensed MIT. It adds 105 tokens to every session and 1,668 once invoked, about $0.0004 per session on Opus 5.5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-31.
algorithms compared with skills from other repositories
| Mod | Type | Stars | Last push | Licence | Scan | Tokens | Works with |
|---|---|---|---|---|---|---|---|
| algorithmsTyler-R-Kendrick/agent-skills | Skill | 13 | 5mo ago | MIT | A | 105 | Claude Code |
| hr-onboardingnexu-io/open-design | Skill | 106k | yesterday | Apache-2.0 | A | 62 | Claude Code, Codex |
| book-mirrorgarrytan/gbrain | Skill | 32k | yesterday | MIT | A | 138 | Claude Code |
| exam-forecastanthropics/claude-for-legal | Skill | 9.9k | 3d ago | Apache-2.0 | A | 73 | Claude Code |
| lean-formalizewanshuiyin/Auto-claude-code-research-in-sleep | Skill | 19k | 3d ago | MIT | A | 81 | Claude Code |
| eli5companion-inc/feynman | Skill | 10k | 6d ago | MIT | A | 63 | Claude Code, Codex |
| deck-course-modulenexu-io/html-anything | Skill | 9.4k | 25d ago | Apache-2.0 | A | 25 | Claude Code, Codex |