Faster
Implemention of find and remember
lUse the concept of hashing.
lHashing computes a numeric signature for the proposed new item.
lIt then uses the signature to access an array (called a hash table) of Òequivalence classesÓ of items.
lEach equivalence class ideally has a relatively small number of items in it.
lThe only searching needed is that of searching the small equivalence class,
not the whole universe.