Hashes can sometimes be cached, if there is ample home in the information construction where the key is stored; caching the results of comparisons (a binary operation) is often impractical. On the flip side, comparisons can advantage from shortcutting: if keys frequently vary within the initial