The Joys of Hashing
Autor Thomas Mailunden Limba Engleză Paperback – 26 oct 2024
Build working implementations of hash tables, written in the C programming language. This book starts with simple first attempts devoid of collision resolution strategies, and moves through improvements and extensions illustrating different design ideas and approaches, followed by experiments to validate the choices.
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.
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (2) | 206.39 lei 3-5 săpt. | |
| Apress – 10 feb 2019 | 206.39 lei 3-5 săpt. | |
| Apress – 26 oct 2024 | 284.03 lei 38-44 zile |
Preț: 284.03 lei
Preț vechi: 355.04 lei
-20% Nou
Puncte Express: 426
Preț estimativ în valută:
54.37€ • 56.60$ • 44.76£
54.37€ • 56.60$ • 44.76£
Carte tipărită la comandă
Livrare economică 28 ianuarie-03 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9798868808258
Pagini: 232
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.36 kg
Ediția:Second Edition
Editura: Apress
Pagini: 232
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.36 kg
Ediția:Second Edition
Editura: Apress
Cuprins
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 Valuse.- 6. Heuristic Hash Functions.- 7. Universal Hashing.- 8. Conclusions.
Notă biografică
Thomas Mailund is an associate professor in bioinformatics at Aarhus University, Denmark. He has a background in math and computer science, including experience programming and teaching in C and R programming languages. For the last decade, his main focus has been on genetics and evolutionary studies, particularly comparative genomics, speciation, and gene flow between emerging species.
Textul de pe ultima copertă
Build working implementations of hash tables, written in the C programming language. This book starts with simple first attempts devoid of collision resolution strategies, and moves through improvements and extensions illustrating different design ideas and approaches, followed by experiments to validate the choices.
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.
You will:
- 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
Caracteristici
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