If an algorithm has running time g(n), what size problems can we solve if we can wait a million units?
We'll plot all the g(n)s for various n on a scale of one to a million.
(Inspired by the short film ``Powers of Ten,'' by Charles and Ray Eames.)
