| 000 -LEADER |
|---|
| fixed length control field |
a |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
250609b xxu||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9798868808258 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
005.741 |
| Item number |
MAI |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Mailund, Thomas. |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
The joys of hashing : hash table programming with c |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Name of publisher, distributor, etc |
Apress, |
| Date of publication, distribution, etc |
2024. |
| Place of publication, distribution, etc |
Berkeley : |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xi,218 p. ; |
| Other physical details |
ill., port, tables |
| Dimensions |
24 cm |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
49.99 |
| Price type code |
€ |
| Unit of pricing |
100.40 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references and index |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
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 |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Calculated addressing |
|
|---|
| Topical term or geographic name as entry element |
Hashing |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
Books |