Home > Store

Hacker's Delight, 2nd Edition

Register your product to gain access to bonus material or receive a coupon.

Hacker's Delight, 2nd Edition

Best Value Purchase

Book + eBook Bundle

  • Your Price: $64.79
  • List Price: $107.98
  • Includes EPUB, MOBI, and PDF
  • About eBook Formats
  • This eBook includes the following formats, accessible from your Account page after purchase:

    ePub EPUB The open industry format known for its reflowable content and usability on supported mobile devices.

    MOBI MOBI The eBook format compatible with the Amazon Kindle and Amazon Kindle applications.

    Adobe Reader PDF The popular standard, used most often with the free Adobe® Reader® software.

    This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.

More Purchase Options

Book

  • Your Price: $47.99
  • List Price: $59.99
  • Usually ships in 24 hours.

eBook (Watermarked)

  • Your Price: $38.39
  • List Price: $47.99
  • Includes EPUB, MOBI, and PDF
  • About eBook Formats
  • This eBook includes the following formats, accessible from your Account page after purchase:

    ePub EPUB The open industry format known for its reflowable content and usability on supported mobile devices.

    MOBI MOBI The eBook format compatible with the Amazon Kindle and Amazon Kindle applications.

    Adobe Reader PDF The popular standard, used most often with the free Adobe® Reader® software.

    This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.

Description

  • Copyright 2013
  • Dimensions: 6-1/4" x 9-1/8"
  • Pages: 512
  • Edition: 2nd
  • Book
  • ISBN-10: 0-321-84268-5
  • ISBN-13: 978-0-321-84268-8

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

Sample Content

Online Sample Chapter

Hacker's Delight: The Basics

Sample Pages

Download the sample pages (includes Chapter 2 and Index)

Table of Contents

Foreword xiii

Preface xv

Chapter 1: Introduction 1

1.1 Notation 1

1.2 Instruction Set and Execution Time Model 5

Chapter 2: Basics 11

2.1 Manipulating Rightmost Bits 11

2.2 Addition Combined with Logical Operations 16

2.3 Inequalities among Logical and Arithmetic Expressions 17

2.4 Absolute Value Function 18

2.5 Average of Two Integers 19

2.6 Sign Extension 19

2.7 Shift Right Signed from Unsigned 20

2.8 Sign Function 20

2.9 Three-Valued Compare Function 21

2.10 Transfer of Sign Function 22

2.11 Decoding a “Zero Means 2**n” Field 22

2.12 Comparison Predicates 23

2.13 Overflow Detection 28

2.14 Condition Code Result of Add, Subtract, and Multiply 36

2.15 Rotate Shifts 37

2.16 Double-Length Add/Subtract 38

2.17 Double-Length Shifts 39

2.18 Multibyte Add, Subtract, Absolute Value 40

2.19 Doz, Max, Min 41

2.20 Exchanging Registers 45

2.21 Alternating among Two or More Values 48

2.22 A Boolean Decomposition Formula 51

2.23 Implementing Instructions for all 16 Binary Boolean Operations 53

Chapter 3: Power-of-2 Boundaries 59

3.1 Rounding Up/Down to a Multiple of a Known Power of 2 59

3.2 Rounding Up/Down to the Next Power of 2 60

3.3 Detecting a Power-of-2 Boundary Crossing 63

Chapter 4: Arithmetic Bounds 67

4.1 Checking Bounds of Integers 67

4.2 Propagating Bounds through Add’s and Subtract’s 70

4.3 Propagating Bounds through Logical Operations 73

Chapter 5: Counting Bits 81

5.1 Counting 1-Bits 81

5.2 Parity 96

5.3 Counting Leading 0’s 99

5.4 Counting Trailing 0’s 107

Chapter 6: Searching Words 117

6.1 Find First 0-Byte 117

6.2 Find First String of 1-Bits of a Given Length 123

6.3 Find Longest String of 1-Bits 125

6.4 Find Shortest String of 1-Bits 126

Chapter 7: Rearranging Bits And Bytes 129

7.1 Reversing Bits and Bytes 129

7.2 Shuffling Bits 139

7.3 Transposing a Bit Matrix 141

7.4 Compress, or Generalized Extract 150

7.5 Expand, or Generalized Insert 156

7.6 Hardware Algorithms for Compress and Expand 157

7.7 General Permutations, Sheep and Goats Operation 161

7.8 Rearrangements and Index Transformations 165

7.9 An LRU Algorithm 166

Chapter 8: Multiplication 171

8.1 Multiword Multiplication 171

8.2 High-Order Half of 64-Bit Product 173

8.3 High-Order Product Signed from/to Unsigned 174

8.4 Multiplication by Constants 175

Chapter 9: Integer Division 181

9.1 Preliminaries 181

9.2 Multiword Division 184

9.3 Unsigned Short Division from Signed Division 189

9.4 Unsigned Long Division 192

9.5 Doubleword Division from Long Division 197

Chapter 10: Integer Division By Constants 205

10.1 Signed Division by a Known Power of 2 205

10.2 Signed Remainder from Division by a Known Power of 2 206

10.3 Signed Division and Remainder by Non-Powers of 2 207

10.4 Signed Division by Divisors ≥ 2 210

10.5 Signed Division by Divisors ≤ —2  218

10.6 Incorporation into a Compiler 220

10.7 Miscellaneous Topics 223

10.8 Unsigned Division  227

10.9 Unsigned Division by Divisors ≥ 1 230

10.10 Incorporation into a Compiler (Unsigned) 232

10.11 Miscellaneous Topics (Unsigned) 234

10.12 Applicability to Modulus and Floor Division 237

10.13 Similar Methods 237

10.14 Sample Magic Numbers 238

10.15 Simple Code in Python 240

10.16 Exact Division by Constants 240

10.17 Test for Zero Remainder after Division by a Constant 248

10.18 Methods Not Using Multiply High 251

10.19 Remainder by Summing Digits 262

10.20 Remainder by Multiplication and Shifting Right 268

10.21 Converting to Exact Division 274

10.22 A Timing Test 276

10.23 A Circuit for Dividing by 3 276

Chapter 11: Some Elementary Functions 279

11.1 Integer Square Root 279

11.2 Integer Cube Root 287

11.3 Integer Exponentiation 288

11.4 Integer Logarithm 291

Chapter 12: Unusual Bases For Number Systems 299

12.1 Base —2 299

12.2 Base —1 + i 306

12.3 Other Bases 308

12.4 What Is the Most Efficient Base? 309

Chapter 13: Gray Code 311

13.1 Gray Code 311

13.2 Incrementing a Gray-Coded Integer 313

13.3 Negabinary Gray Code 315

13.4 Brief History and Applications 315

Chapter 14: Cyclic Redundancy Check 319

14.1 Introduction 319

14.2 Theory 320

14.3 Practice 323

Chapter 15: Error-Correcting Codes 331

15.1 Introduction 331

15.2 The Hamming Code 332

15.3 Software for SEC-DED on 32 Information Bits 337

15.4 Error Correction Considered More Generally 342

Chapter 16: Hilbert's Curve 355

16.1 A Recursive Algorithm for Generating the Hilbert Curve 356

16.2 Coordinates from Distance along the Hilbert Curve 358

16.3 Distance from Coordinates on the Hilbert Curve 366

16.4 Incrementing the Coordinates on the Hilbert Curve 368

16.5 Non-Recursive Generating Algorithms 371

16.6 Other Space-Filling Curves 371

16.7 Applications 372

Chapter 17: Floating-Point 375

17.1 IEEE Format 375

17.2 Floating-Point To/From Integer Conversions 377

17.3 Comparing Floating-Point Numbers Using Integer Operations 381

17.4 An Approximate Reciprocal Square Root Routine 383

17.5 The Distribution of Leading Digits 385

17.6 Table of Miscellaneous Values 387

Chapter 18: Formulas For Primes 391

18.1 Introduction 391

18.2 Willans’s Formulas 393

18.3 Wormell’s Formula 397

18.4 Formulas for Other Difficult Functions 398

Answers To Exercises: 405


Appendix A: Arithmetic Tables For A 4-Bit Machine 453


Appendix B: Newton's Method 457


Appendix C: A Gallery Of Graphs Of Discrete Functions 459

C.1 Plots of Logical Operations on Integers 459

C.2 Plots of Addition, Subtraction, and Multiplication 461

C.3 Plots of Functions Involving Division 463

C.4 Plots of the Compress, SAG, and Rotate Left Functions 464

C.5 2D Plots of Some Unary Functions 466

Bibliography      471

Index      481

Updates

Errata

We've made every effort to ensure the accuracy of this book and any companion content. Any errors that have been confirmed since this book was published can be downloaded below.

Download the errata

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020