Overview
- Gives the pros and cons of different design choices when building tables
- Walks you through the implementation of efficient hash tables
- Contains a particular focus on teaching hash tables programming using the C programming language
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (8 chapters)
Keywords
About this book
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.
The Joys of Hashing walks you through the implementation of efficient hash tables and the pros and cons of different design choices when building tables. The source code used in the book is available on GitHub for your re-use and experiments.
What You Will Learn
- Master the basic ideas behind hash tables
- Carry out collision resolution, including strategies for handling collisions and their consequences for performance
- Resize or grow and shrink tables as needed
- Store values by handling when values must be stored with keys to make general sets and maps
Who This Book Is For
Those with at least some prior programming experience, especially in C programming.
Authors and Affiliations
About the author
Bibliographic Information
Book Title: The Joys of Hashing
Book Subtitle: Hash Table Programming with C
Authors: Thomas Mailund
DOI: https://doi.org/10.1007/978-1-4842-4066-3
Publisher: Apress Berkeley, CA
eBook Packages: Professional and Applied Computing, Apress Access Books, Professional and Applied Computing (R0)
Copyright Information: Thomas Mailund 2019
Softcover ISBN: 978-1-4842-4065-6Published: 10 February 2019
eBook ISBN: 978-1-4842-4066-3Published: 09 February 2019
Edition Number: 1
Number of Pages: XI, 206
Number of Illustrations: 72 b/w illustrations
Topics: Programming Languages, Compilers, Interpreters, Programming Techniques