"This is the first book that promises to tell the deep, dark secrets of computer arithmetic, and it delivers in spades. It contains every trick I knew plus many, many more. A godsend for library developers, compiler writers, and lovers of elegant hacks, it deserves a spot on your shelf right next to Knuth." --Josh Bloch (Praise for the first edition) In Hacker’s Delight, Second Edition, Hank Warren once again compiles an irresistible collection of programming hacks: timesaving techniques, algorithms, and tricks that help programmers build more elegant and efficient software, while also gaining deeper insights into their craft. Warren’s hacks are eminently practical, but they’re also intrinsically interesting, and sometimes unexpected, much like the solution to a great puzzle. They are, in a word, a delight to any programmer who is excited by the opportunity to improve. Extensive additions in this edition include A new chapter on cyclic redundancy checking (CRC), including routines for the commonly used CRC-32 code. A new chapter on error correcting codes (ECC), including routines for the Hamming code. More coverage of integer division by constants, including methods using only shifts and adds. Computing remainders without computing a quotient. More coverage of population count and counting leading zeros Array population count New algorithms for compress and expand. An LRU algorithm Floating-point to/from integer conversions. Approximate floating-point reciprocal square root routine A gallery of graphs of discrete functions. Now with exercises and answers