Hashes can sometimes be cached, if there is more than enough place in the data composition where the key is saved; caching the results of comparisons (a binary operation) is usually impractical. On the other hand, comparisons can gain from shortcutting: if keys often vary within the initial several