PREV INDEX NEXT

Author: Stan Eisenstat
Subject: Re: [Cs323] Chaining
Date: Monday, 02 Nov 2020, 09:32:28


    > Message Posted By: Unknown
    >
    > Does hashing with chaining imply the use of pointers (to get the next
    > element), or are there ways to eliminate it (i.e. for memory saving)?

Hashing with chaining requires a way to get from the
header node to the first node in its chain (if any) and
from one node in the chain to the next (if any).  A C
pointer is one way, but the hint in the specification

  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?

suggests another.

--Stan-
PREV INDEX NEXT