The simplest approach is called separate chaining. The idea is to think of each of the m locations of the hash
table as being simple head pointers to m linked list. The link list table[i] holds all keys that hash to location
i. To insert a key k we simply compute h(k) and insert the new element into this linked list (we should fi rst
search the list to make sure it is not a duplicate). To fi nd a key we just search this linked list. To delete a key
we delete it from this linked list. An example is where we use the last digit as the hash function (a bad choice
normally). Fig. C.23 shows separate ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.
Julian F.
Head of Cybersecurity
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.
Addison B.
Field Engineer
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.
Amir M.
Data Platform Tech Lead
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.