Looking for some inspiration for improving your algorithms?

Examples

I discuss several well-known algorithms, demonstrating how mathematical principals can be applied to produce practically or asymptotically faster code.

Each algorithm is represented by a card. Simply select a topic that piques your interest. There’s no prescribed order for reading them.

Up to you
Card’s content

The rough structure of most articles is:

  1. Review of some underlying mathematics
  2. Presentation of a basic, naïve implementation
  3. Step-by-step refinement of the code
  4. A practically or asymptotically faster code
boxes with numbers The Euclidean Algorithm

The Euclidean Algorithm is probably the most famous algorithm to compute the greatest common divisor of two integers.