03282nam a22004815i 4500 979-8-8688-0826-5 DE-He213 20251030113247.0 cr nn 008mamaa 241026s2024 xxu| s |||| 0|eng d 9798868808265 979-8-8688-0826-5 10.1007/979-8-8688-0826-5 doi QA76.76.C65 UMC bicssc COM010000 bisacsh UMC thema Mailund, Thomas. author. aut http://id.loc.gov/vocabulary/relators/aut 86663 The Joys of Hashing [electronic resource] : Hash Table Programming with C / by Thomas Mailund. 2nd ed. 2024. Berkeley, CA : Apress : Imprint: Apress, 2024. XI, 218 p. 74 illus. online resource. text txt rdacontent computer c rdamedia online resource cr rdacarrier text file PDF rda 1. The Joys of Hashing -- 2. Hash Keys, Indices and Collisions -- 3. Collision Resolution, Load Factor and Performance -- 4. Resizing -- 5. Adding Application Keys and Values -- 6. Heuristic Hash Functions -- 7. Universal Hashing -- 8. Conclusions. Build working implementations of hash tables, written in the C programming language. The new and revised Second Edition has been enhanced with simplified code and more comprehensive explanations, aimed at improving clarity and comprehension while exploiting the latest features in C programming. This book starts with simple first attempts devoid of collision resolution strategies. It then progresses through improvements and extensions illustrating different design ideas and approaches, followed by experiments to validate the choices. You will learn how 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. Compilers (Computer programs). 66172 Computer programming. Compilers and Interpreters. 66173 Programming Techniques. 65517 SpringerLink (Online service) Springer Nature eBook Printed edition: 9798868808258 Printed edition: 9798868808272 https://doi.org/10.1007/979-8-8688-0826-5 ZDB-2-CWD ZDB-2-SXPC 64522 64522