Home > Store

MMIX Supplement, The: Supplement to The Art of Computer Programming Volumes 1, 2, 3 by Donald E. Knuth

eBook (Watermarked)

  • Your Price: $22.07
  • List Price: $27.59
  • Includes EPUB 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.

    Adobe Reader PDF The popular standard, used most often with the free Acrobat® 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.

Also available in other formats.

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


  • Copyright 2015
  • Pages: 224
  • Edition: 1st
  • eBook (Watermarked)
  • ISBN-10: 0-13-399286-1
  • ISBN-13: 978-0-13-399286-1

The MMIX Supplement: Supplement to The Art of Computer ProgrammingVolumes 1, 2, 3 by Donald E. Knuth

“I encourage serious programmers everywhere to sharpen their skills by devouring this book.”

–Donald E. Knuth

In the first edition of Volume 1 of The Art of Computer Programming, Donald E. Knuth introduced the MIX computer and its machine language: a teaching tool that powerfully illuminated the inner workings of the algorithms he documents. Later, with the publication of his Fascicle 1, Knuth introduced MMIX: a modern, 64-bit RISC replacement to the now-obsolete MIX. Now, with Knuth’s guidance and approval, Martin Ruckert has rewritten all MIX example programs from Knuth’s Volumes 1-3 for MMIX, thus completing this MMIX update to the original classic.

Building on contributions from the international MMIXmasters volunteer group, Ruckert fully addresses MMIX basic concepts, information structures, random numbers, arithmetic, sorting, and searching. In the preparation of this supplement, about 15,000 lines of MMIX code were written and checked for correctness; over a thousand test cases were written and executed to ensure the code is of the highest possible quality.

The MMIX Supplement should be read side by side with The Art of Computer Programming, Volumes 1-3, and Knuth’s Fascicle 1, which introduces the MMIX computer, its design, and its machine language. Throughout, this supplement contains convenient page references to corresponding coverage in the original volumes. To further simplify the transition to MMIX, Ruckert stayed as close as possible to the original–preserving programming style, analysis techniques, and even wording, while highlighting differences where appropriate. The resulting text will serve as a bridge to the future, helping readers apply Knuth’s insights in modern environments, until his revised, “ultimate” edition of The Art of Computer Programming is available.

From Donald E. Knuth’s Foreword:

“I am thrilled to see the present book by Martin Ruckert: It is jam-packed with goodies from which an extraordinary amount can be learned. Martin has not merely transcribed my early programs for MIX and recast them in a modern idiom. He has penetrated to their essence and rendered them anew with elegance and good taste. His carefully checked code represents a significant contribution to the art of pedagogy as well as to the art of programming.”

Dr. Martin Ruckert maintains the MMIX home page at mmix.cs.hm.edu. He is professor of mathematics and computer science at Munich University of Applied Sciences in Munich, Germany.

Sample Content

Table of Contents

Foreword iii

Preface v

Style Guide viii

Programming Techniques xii

Chapter 1: Basic Concepts 1

1.3.3. Applications to Permutations 1

1.4.4. Input and Output 8

Chapter 2: Information Structures 15

2.1. Introduction 15

2.2.2. Sequential Allocation 17

2.2.3. Linked Allocation 18

2.2.4. Circular Lists 25

2.2.5. Doubly Linked Lists 27

2.2.6. Arrays and Orthogonal Lists 36

2.3.1. Traversing Binary Trees 37

2.3.2. Binary Tree Representation of Trees 39

2.3.3. Other Representations of Trees 43

2.3.5. Lists and Garbage Collection 44

2.5. Dynamic Storage Allocation 45

Chapter 3: Random Numbers 48 Choice of modulus 48 Potency 49

3.2.2. Other Methods 50

3.4.1. Numerical Distributions 51

3.6. Summary 52

Chapter 4: Arithmetic 53

4.1. Positional Number Systems 53

4.2.1. Single-Precision Calculations 53

4.2.2. Accuracy of Floating Point Arithmetic 58

4.2.3. Double-Precision Calculations 58

4.3.1. The Classical Algorithms 62

4.4. Radix Conversion 68

4.5.2. The Greatest Common Divisor 70

4.5.3. Analysis of Euclid’s Algorithm 71

4.5.4. Factoring into Primes 72

4.6.3. Evaluation of Powers 72

4.6.4. Evaluation of Polynomials 73

Chapter 5: Sorting 74

5.2. Internal Sorting 74

5.2.1. Sorting by Insertion 76

5.2.2. Sorting by Exchanging 81

5.2.3. Sorting by Selection 87

5.2.4. Sorting by Merging 89

5.2.5. Sorting by Distribution 93

5.3.1. Minimum-Comparison Sorting 94

5.5. Summary, History, and Bibliography 95

Chapter 6: Searching 97

6.1. Sequential Searching 97

6.2.1. Searching an Ordered Table 99

6.2.2. Binary Tree Searching 102

6.2.3. Balanced Trees 103

6.3. Digital Searching 106

6.4. Hashing 108

Answers to Exercises 117

1.3.2. The MMIX Assembly Language 117

1.3.3. Applications to Permutations 120

1.4.4. Input and Output 120

2.1. Introduction 122

2.2.2. Sequential Allocation 123

2.2.3. Linked Allocation 124

2.2.4. Circular Lists 128

2.2.5. Doubly Linked Lists 130

2.2.6. Arrays and Orthogonal Lists 132

2.3.1. Traversing Binary Trees 134

2.3.2. Binary Tree Representation of Trees 136

2.3.5. Lists and Garbage Collection 139

2.5. Dynamic Storage Allocation 140 Choice of modulus 147 Potency 148

3.2.2. Other Methods 148

3.4.1. Numerical Distributions 149

3.6. Summary 150

4.1. Positional Number Systems 150

4.2.1. Single-Precision Calculations 151

4.2.2. Accuracy of Floating Point Arithmetic 152

4.2.3. Double-Precision Calculations 153

4.3.1. The Classical Algorithms 156

4.4. Radix Conversion 158

4.5.2. The Greatest Common Divisor 160

4.5.3. Analysis of Euclid’s Algorithm 160

4.6.3. Evaluation of Powers 161

4.6.4. Evaluation of Polynomials 161

5. Sorting 162

5.2. Internal Sorting 162

5.2.1. Sorting by Insertion 165

5.2.2. Sorting by Exchanging 169

5.2.3. Sorting by Selection 174

5.2.4. Sorting by Merging 175

5.2.5. Sorting by Distribution 179

5.3.1. Minimum-Comparison Sorting 180

5.5. Summary, History, and Bibliography 183

6.1. Sequential Searching 183

6.2.1. Searching an Ordered Table 184

6.2.2. Binary Tree Searching 185

6.2.3. Balanced Trees 185

6.3. Digital Searching 185

6.4. Hashing 186

Acknowledgments 188

Index 189


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.


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.


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.


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.


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


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


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.


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.


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