While grappling with the idea of the modulus (beyond the graph, where I liked it), I stumbled upon a great, great little image on Wikipedia.
From the page on the Euclidean algorithm, which is a really cool way of discovering the greatest common divisors of a number, comes an image mapping the time to calculate gcd(x, y)… check it out. Pretty cool!
