Algorithm design

Skill dongzhigang13305312738-art/paper-skills/algorithm-design

Design algorithms with LaTeX pseudocode and UML diagrams. Generate algorithmic environments, Mermaid class/sequence diagrams, and ensure consistency between pseudocode and implementation. Use when formalizing methods for a paper.From its SKILL.md

Install

npx -y skills add dongzhigang13305312738-art/paper-skills --skill algorithm-design

Assembled from the repository path, not quoted from the project. Check it against their README if it does not work.

2 things to look at

no licenseNo license file was found in the repository. Code published without one is not open source by default, so using it at work is a question for whoever answers licensing questions where you are.
0 stars0 stars. Stars are a popularity signal and not a quality one, but at this level it is likely that nobody has read this closely except its author, and you would be relying on your own review.

SKILL.md

2.3 KB, 531 tokens by cl100k_base, as published. Nobody here has run it

Algorithm Design

Formalize methods into algorithm pseudocode and system architecture diagrams.

Input

$0 — Method description or implementation to formalize

References

Algorithm and diagram templates: ~/.claude/skills/algorithm-design/references/algorithm-templates.md

Workflow

Step 1: Formalize the Algorithm

Define clear inputs and outputs
Identify the main loop / recursive structure
Specify all parameters and their types
Write step-by-step pseudocode

Step 2: Generate LaTeX Pseudocode

Use algorithm + algpseudocode environments:

\begin{algorithm}[t]
\caption{Method Name}
\label{alg:method}
\begin{algorithmic}[1]
\Require Input $x$, parameters $\theta$
\Ensure Output $y$
\State Initialize ...
\For{$t = 1$ to $T$}
    \State $z_t \gets f(x_t; \theta)$
    \If{convergence criterion met}
        \State \textbf{break}
    \EndIf
\EndFor
\State \Return $y$
\end{algorithmic}
\end{algorithm}

Step 3: Generate UML Diagrams (Mermaid)

Class Diagram

classDiagram
    class Model {
        +forward(x: Tensor) Tensor
        +train_step(batch) float
    }

Sequence Diagram

sequenceDiagram
    participant M as Main
    participant D as DataLoader
    M->>D: load_data()
    D-->>M: batches

Step 4: Verify Consistency

Every pseudocode step must map to a code module
Every class in the UML must exist in the implementation
Parameter names must match between pseudocode and code

Rules

Use standard algorithmic notation (not code syntax)
Number lines for easy reference
Include complexity analysis as a comment or proposition
Use \Require / \Ensure for inputs/outputs
Keep pseudocode at the right abstraction level — not too detailed, not too vague

Related Skills

Upstream: atomic-decomposition, math-reasoning
Downstream: experiment-code, paper-writing-section
See also: symbolic-equation

What ships with it: 1 file

4.5 KB alongside SKILL.md

references/

algorithm-templates.md4.5 KB