disturbing.pic.twitter.com/c4ggQQgULG
You can add location information to your Tweets, such as your city or precise location, from the web and via third-party applications. You always have the option to delete your Tweet location history. Learn more
Assuming max is chosen to be a tight bound on runtime of any code path, it makes little difference.
only if your worst case is reasonably close to your average case
You expect that to be true; "constant-time" asm would be going out of its way to make that true...
that works out reasonably well for crypto but not if you search a data structure
because if you do data-dependent lookups then the only way to get guaranteed worst case is O(n) traversal
No, you can have an O(log n) lookup worst-case just by allowing for cache-miss every step.
How do you control a cache miss at a single 32-bit datum granularity?
How you compute a tight value for max is of course a problem in itself.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.