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.
The rough structure of most articles is:
The Euclidean Algorithm is probably the most famous algorithm to compute the greatest common divisor of two integers.