03050nam a22004335i 4500001001800000003000900018005001700027007001500044008004100059020003700100024003500137050001600172072001600188072002300204072001500227100008500242245010200327250001800429264005400447300004300501336002600544337002600570338003600596347002400632505025300656520134100909650004202250650002602292650003902318650003502357710003402392773002602426776003602452776003602488856004602524912001402570912001502584999001702599979-8-8688-0826-5DE-He21320251030113247.0cr nn 008mamaa241026s2024    xxu|    s    |||| 0|eng d  a97988688082659979-8-8688-0826-57 a10.1007/979-8-8688-0826-52doi 4aQA76.76.C65 7aUMC2bicssc 7aCOM0100002bisacsh 7aUMC2thema1 aMailund, Thomas.eauthor.4aut4http://id.loc.gov/vocabulary/relators/aut98666314aThe Joys of Hashingh[electronic resource] :bHash Table Programming with C /cby Thomas Mailund.  a2nd ed. 2024. 1aBerkeley, CA :bApress :bImprint: Apress,c2024.  aXI, 218 p. 74 illus.bonline resource.  atextbtxt2rdacontent  acomputerbc2rdamedia  aonline resourcebcr2rdacarrier  atext filebPDF2rda0 a1. 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.  aBuild 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. 0aCompilers (Computer programs).966172 0aComputer programming.14aCompilers and Interpreters.96617324aProgramming Techniques.9655172 aSpringerLink (Online service)0 tSpringer Nature eBook08iPrinted edition:z979886880825808iPrinted edition:z979886880827240uhttps://doi.org/10.1007/979-8-8688-0826-5  aZDB-2-CWD  aZDB-2-SXPC  c64522d64522