Hashes can sometimes be cached, if there is adequate room in the information structure where The main element is saved; caching the results of comparisons (a binary operation) is frequently impractical. Conversely, comparisons can reward from shortcutting: if keys normally differ within the main