Algorithm X is an algorithm for solving the exact cover problem. It is a straightforward recursive, nondeterministic, depth-first, backtracking algorithm used by Donald Knuth to demonstrate an efficient implementation called DLX, which uses the dancing links technique.

Open source resource for learning algorithms and their implementation in any programming language

Mentions differences between Luma/luminance and how to compute the correct values

Rendezvous hashing is an algorithm to solve the distributed hash table problem - a common and general pattern in distributed systems

A really smart ant overall simple checksum that works on unordered collections

A really smart ant overall simple checksum that works on unordered collections

Some simple hash functions including a reversible one.

Another algorithm to generate legible ids.

Now a classic, shows some really smart fractional index tricks to efficiently do collaborative editing on trees. Applies to many apps with structured data!

Article explaining simulation algorithms that produce complex organic behaviours

Had my little foray into spaced repetition while making my flashcards app. Interesting take on adapting a popular algorithm.