Hashes can sometimes be cached, if there is ample space in the information construction where The main element is stored; caching the results of comparisons (a binary operation) is usually impractical. On the other hand, comparisons can benefit from shortcutting: if keys normally differ within t