Foundational algorithms — Euclidean GCD, Newton's method for cube root — with complexity analysis and clean implementations.
/plugin marketplace add Pavel-Kravchenko/Bioinformatics
The exact command may vary by repository. Check the README on GitHub.
For the skill author
Shows your skill is listed on Skillteca, generates a backlink and trackable traffic.
[](https://www.skillteca.com.br/skills/algo-basic-algorithms?utm_source=badge&utm_medium=readme&utm_campaign=badge)
Resources to assist in writing various internal communications, adhering to company-preferred formats. Claude should utilize this skill for status reports, leadership updates, newsletters, FAQs, and other internal documents.
Monitors a pull request or review cycle until it is ready to merge. This skill is used to track PR comments, reviews, and CI status until all actionable issues are resolved.
Execute a phased implementation plan using subagents. Use when asked to execute, run, or carry out a plan — especially one created by make-plan.
Token-optimized structural code search using tree-sitter AST parsing. Use this instead of reading full files when you need to understand code structure, find functions, or explore a codebase efficiently.
Category alert
One short email with only the new DevOps e Infra skills. 4 minutes of reading, no spam, unsubscribe with one click.
You confirm your email on the first send. No spam. Unsubscribe with one click.
| Algorithm | Best | Average | Worst | Space |
|---|---|---|---|---|
| Euclidean GCD | O(1) | O(log min(a,b)) | O(log min(a,b)) | O(1) |
| Newton's cube root | O(1) | O(log 1/ε) | O(max_iter) | O(1) |
Key identity: gcd(a, b) = gcd(b, a % b). Base case: gcd(a, 0) = a.
def gcd(a: int, b: int) -> int:
a, b = abs(a), abs(b)
while b != 0:
a, b = b, a % b
return a
def lcm(a: int, b:
[Description truncada. Veja o README completo no GitHub.]