They must have used the “WEAREPARTOWNEDBYJEFFBEZOS” discount code.
1. I wonder how large their CPU time budget would be without all the caching.
2. Of course they're right. Being twice as fast is generally irrelevant, unless CPU is the bottleneck. We call it O(n), not kO(n), because the k means so little.
They must have used the “WEAREPARTOWNEDBYJEFFBEZOS” discount code.