000			a
999			_c34092 _d34092
008			250609b xxu||||| |||| 00| 0 eng d
020			_a9798868808258
082			_a005.741 _bMAI
100			_aMailund, Thomas.
245			_aThe joys of hashing : hash table programming with c
260			_bApress, _c2024. _aBerkeley :
300			_axi,218 p. ; _bill., port, tables _c24 cm
365			_b49.99 _c€ _d100.40
504			_aIncludes bibliographical references and index
520			_aBuild 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			_aCalculated addressing
650			_aHashing
942			_2ddc _cBK