Artículos relacionados a The Joys of Hashing: Hash Table Programming with C
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del autor
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.
De la contraportada
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
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 65,94
EUR 28,88 gastos de envío desde Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envíoResultados de la búsqueda para The Joys of Hashing: Hash Table Programming with C
Imagen de archivo
2019 PB The Joys of Hashing: Hash Table Programming with C
Librería: Miki Store, San Jose, CA, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
paperback. Condición: Good. Pages are crisp and clean, no marking. Cover is verygood. Binding is tight/good. ex-library book with normal library stamps & stickers. Nº de ref. del artículo: I-bs45
Cantidad disponible: 1 disponibles
Imagen de archivo
The Joys of Hashing: Hash Table Programming With C
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Paperback. Condición: Brand New. 206 pages. 9.00x6.25x0.50 inches. In Stock. Nº de ref. del artículo: zk1484240650
Gastos de envío:
EUR 28,88
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles