Author: Unknown
Subject: Hash table hint
Date: Thursday, 12 Nov 2020, 06:06:14

The hint suggests using one large array to store all nodes and then using header nodes to point into different points of the large array to start chains, but how do we keep chains from colliding into each other then? If we have a large array of 100 entries and 10 headers that point into places dividing it up into 10 segments of 10, doesn't that limit our bucket size to 10 before we have to redo the entire hash table?