Hash tables, when implemented and used appropriately, are exceptionally efficient data structures for representing sets and lookup tables, providing low overhead, constant time, insertion, deletion, and lookup operations. This book walks you through the implementation of efficient hash tables and the pros and cons of different design choices when building tables.
Before you buy this book, be aware that it is a work in progress! I am updating it one chapter at a time. If you buy this version, though, you also get all the updates coming later. When you buy this book, you will be subscribed to a mailing list that will inform you of updates. You will only get updates on this book. If you are interested in updates on other books, you can subscribe to my general mailing list here https://tinyurl.com/mailund-books
Pay what you want:
To be able to receive payments, please enter your payment details.