A hash table insertion or retrieval with no collisions is anO(1) operation. Collisions reduce the O(1) behavior to somethingless desirable. There are two ways to reduce collisions: • Increasethe size of the table. As the table size increases, the statisticalprobability of collisions for unique keys decreases. The problemwith arbitrarily increasing the table size is that the amount ofphysical memory is finite and to declare a wildly large table inthe hope of reducing collisions wastes memory. • Enhance thequality of the hash() function so that it produces fewercollisions. Ideally, unique keys have unique indexes into the hashtable and no collisions. This
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured