Division method(continued) h(k)=k mod m Pick m to be a prime not too close to a power of 2 or 10 and not otherwise used prominently in the computing environment Annoyance. Sometimes. making the table size a prime is convenient But, this method is popular although the next method we ll see is usually superior o 2001 by Charles E Leiserson Introduction to Algorithms Day 11 L7.10© 2001 by Charles E. Leiserson Introduction to Algorithms Day 11 L7.10 Division method (continued) h(k) = k mod m. Pick m to be a prime not too close to a power of 2 or 10 and not otherwise used prominently in the computing environment. Annoyance: • Sometimes, making the table size a prime is inconvenient. But, this method is popular, although the next method we’ll see is usually superior