PREV INDEX NEXT

Author: Unknown
Subject: Hash Table Clarification
Date: Friday, 30 Oct 2020, 17:14:54

Under Note E of the spec is the following:

Here are some hints on how to achieve a small footprint:
1) If you allocate one array for all of the nodes in the hash table other than the heads of the chains, how many bytes do you need to specify a node?


Could you please explain the rationale behind the first part of this hint? Specifically how/why we are allocating "one array for all of the nodes in the hash table other than the heads of the chains", and if this is the recommended approach for constructing our hash table.
PREV INDEX NEXT