April 2018
Beginner to intermediate
426 pages
10h 19m
English
The separate chaining technique consists of creating a linked list for each position of the table and storing the elements in it. It is the simplest technique to handle collisions; however, it requires additional memory outside the HashTable instance.
For example, if we use separate chaining in the code we used to do some testing in the previous topic and represented it in a diagram, this would be the output (the values have been omitted from the diagram to simplify it):

At position 5, we would have a LinkedList instance with four elements in it, at positions 7, and 10, we would have LinkedList instances with two elements ...