| 000 | 03282nam a22004815i 4500 | ||
|---|---|---|---|
| 001 | 979-8-8688-0826-5 | ||
| 003 | DE-He213 | ||
| 005 | 20251030113247.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 241026s2024 xxu| s |||| 0|eng d | ||
| 020 |
_a9798868808265 _9979-8-8688-0826-5 |
||
| 024 | 7 |
_a10.1007/979-8-8688-0826-5 _2doi |
|
| 050 | 4 | _aQA76.76.C65 | |
| 072 | 7 |
_aUMC _2bicssc |
|
| 072 | 7 |
_aCOM010000 _2bisacsh |
|
| 072 | 7 |
_aUMC _2thema |
|
| 100 | 1 |
_aMailund, Thomas. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _986663 |
|
| 245 | 1 | 4 |
_aThe Joys of Hashing _h[electronic resource] : _bHash Table Programming with C / _cby Thomas Mailund. |
| 250 | _a2nd ed. 2024. | ||
| 264 | 1 |
_aBerkeley, CA : _bApress : _bImprint: Apress, _c2024. |
|
| 300 |
_aXI, 218 p. 74 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 505 | 0 | _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. | |
| 520 | _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. | ||
| 650 | 0 |
_aCompilers (Computer programs). _966172 |
|
| 650 | 0 | _aComputer programming. | |
| 650 | 1 | 4 |
_aCompilers and Interpreters. _966173 |
| 650 | 2 | 4 |
_aProgramming Techniques. _965517 |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9798868808258 |
| 776 | 0 | 8 |
_iPrinted edition: _z9798868808272 |
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/979-8-8688-0826-5 |
| 912 | _aZDB-2-CWD | ||
| 912 | _aZDB-2-SXPC | ||
| 999 |
_c64522 _d64522 |
||