So I put this together. It’s a comparison of various Big-O running times. It was an exercise in a book I’m reading: Introduction to Algorithms, 3rd Edition, which is obsolete now as the 4ed is out.