Hashes can sometimes be cached, if there is adequate area in the info construction where the key is stored; caching the results of comparisons (a binary operation) is commonly impractical. Conversely, comparisons can advantage from shortcutting: if keys normally vary within the first number of b