One named algorithm, data structure or technique in full: what it solves, preconditions, complexity bounds with their kind (worst-case / expected / amortized) and textbook citations, when to use it and what to use instead, the NIST DADS dictionary entry (definition, relations, implementation links), the cp-algorithms article, Skiena Algorithm Repository problem pages, and which languages Rosetta Code has solutions in. Accepts short names ("Dijkstra", "KMP", "union-find") and aliases.