https://books.google.com/books/about/Hacker_s_Delight.html?id=VicPJYM0I5QC Search Images Maps Play YouTube News Gmail Drive More >> Sign in Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader. Books Try the new Google Books Check out the new look and enjoy easier access to your favorite features Try it now No thanks [ogen_books] [book_icon_]Try the new Google Books[arrow_righ] 1. Try the new Google Books 2. My library 3. Help 4. Advanced Book Search Buy eBook - $37.67 Get this book in print * Amazon.com * Barnes&Noble.com * Books-A-Million * IndieBound * ----------------------------------------------------------------- * Find in a library * All sellers >> Hacker's Delight Front Cover Henry S. Warren Addison-Wesley, Sep 25, 2012 - Computers - 512 pages 2 Reviews Reviews aren't verified, but Google checks for and removes fake content when it's identified "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 [ ] [Search inside] Preview this book >> What people are saying - Write a review Reviews aren't verified, but Google checks for and removes fake content when it's identified LibraryThing Review User Review - worrydream - LibraryThing First of all, the book itself is incredible. The title was poorly chosen, unfortunately. The connotation of "hacker" in the public mind is somewhat different than the word's meaning forty years ago at ... Read full review Selected pages Page 3 Page 3 Page 2 Page 2 Page 94 Page 94 Page 77 Page 77 Page 75 Page 75 Contents CHAPTER 1 INTRODUCTION 1 CHAPTER 2 BASICS 11 CHAPTER 3 POWEROF2 BOUNDARIES 59 CHAPTER 4 ARITHMETIC BOUNDS 67 CHAPTER 5 COUNTING BITS 81 CHAPTER 6 SEARCHING WORDS 117 CHAPTER 7 REARRANGING BITS AND BYTES 129 CHAPTER 8 MULTIPLICATION 171 CHAPTER 14 CYCLIC REDUNDANCY CHECK 319 CHAPTER 15 ERRORCORRECTING CODES 331 CHAPTER 16 HILBERTS CURVE 355 CHAPTER 17 FLOATINGPOINT 375 CHAPTER 18 FORMULAS FOR PRIMES 391 ANSWERS TO EXERCISES 405 APPENDIX A ARITHMETIC TABLES FOR A 4BIT MACHINE 453 APPENDIX B NEWTONS METHOD 457 More CHAPTER 9 INTEGER DIVISION 181 CHAPTER 10 INTEGER DIVISION BY CONSTANTS 205 CHAPTER 11 SOME ELEMENTARY FUNCTIONS 279 CHAPTER 12 UNUSUAL BASES FOR NUMBER SYSTEMS 299 CHAPTER 13 GRAY CODE 311 APPENDIX C A GALLERY OF GRAPHS OF DISCRETE FUNCTIONS 459 Bibliography 471 Index 481 Copyright Less Other editions - View all Hacker's Delight [content] Henry S. Warren Limited preview - 2013 Hacker's Delight [content] Henry S. Warren Limited preview - 2003 Hacker's Delight [content] Henry S. Warren Snippet view - 2003 Common terms and phrases 32 bits 32-bit machine algorithm apply arithmetic array base basic RISC instructions binary bit positions Boolean branch-free byte calculated check bits checksum code of Figure code words column complement compute constant correct cycles denotes digits divide dividend divisor Equation error example executes expression floating-point formula formula for primes function gives Gray code Hamming code hexadecimal high-order bit Hilbert curve implemented information bits integer square root iteration leading zeros length load loop magic number mask matrix method modulo multiplicative inverse negative number of 1-bits number of leading operands operation overflow parity bit perfect shuffle permutation polynomial population count predicate quantity quotient range remainder modulo requires result return q rightmost rotate shift amount shift left shift right shown in Figure sign bit simple string of 1's subtraction swap table lookup theorem tion unsigned division unsigned integers variables About the author (2012) Henry S. Warren, Jr., has had a fifty-year career with IBM, spanning from the IBM 704 to the PowerPC and beyond. He has worked on various military command and control systems and on the SETL (SET Language) project under Jack Schwartz. Since 1973, Hank has been with IBM's Research Division, focusing on compilers and computer architectures. He currently works on a supercomputer project aimed at an exaflop. Hank received his Ph.D. in computer science from the Courant Institute at New York University. Bibliographic information QR code for Hacker's Delight Title Hacker's Delight Author Henry S. Warren Edition 2 Publisher Addison-Wesley, 2012 ISBN 0133085015, 9780133085013 Length 512 pages Computers > Programming Subjects > Algorithms Computers / Programming / Algorithms Export Citation BiBTeX EndNote RefMan About Google Books - Privacy Policy - Terms of Service - Information for Publishers - Report an issue - Help - Google Home