Home

News

FAQ

Mailing Lists

How to Volunteer

The Volunteers

MMIX Programs

Links

The MIX Programs in The Art of Computer Programming Needing Conversion to MMIX

Volume 1: Fundamental Algorithms, 3/e, First Printing, May 1997

Volunteer Section Page Program Status
Brendan Van Horn 2.1 236 Algorithm A (5)
Ron Hatcher 2.2.3 258-259 (insertion) (10) & (deletion) (11)
Ron Hatcher 2.2.3 266-268 Program T (Topological Sort)
Steve  Chapel 2.2.4 277-278, 552-553 Program A (Addition of Polynomials), #15
Garyl Hester 2.2.5 289-295, 554-555, 568 The Elevator Simulation, #8 & #9, #22
Yuval Yarom 2.3.1 325, 567 Programs S & T, #20
Steve  Chapel 2.3.2 342-345, 572-573 Program D (Differentiation), #13
Brendan Van Horn 2.1 535 #8
Brendan Van Horn 2.1 535 #9
Ron Hatcher 2.2.3 545 #2, #3, #4
Ron Hatcher 2.2.3 546 #8
Ron Hatcher 2.2.3 548-549 #24
Ron Hatcher 2.2.3 550 #27
Steve  Chapel 2.2.4 552 #11
Steve  Chapel 2.2.4 552 #13
Steve  Chapel 2.2.4 552 #14
Valerio Aimale 2.2.5 556 #9
  2.2.6 557-559 #15
Steve  Chapel 2.3.2 573 #15
Steve  Chapel 2.3.2 574 #16
Anthony David 2.3.5 601-602 #4
Philip H. Jensen 2.5 607 #4
Philip H. Jensen 2.5 609-610 #13, #15, #16
  2.5 611-613 #27, #28
  2.5 614 #34

Volume 2: Seminumerical Algorithms, 3/e, First Printing, September 1997

Volunteer Section Page Program Status
 Tushar Patel 3.2.2 28, 556 Program A (Additive number generator), #25
  4.2.1 218-219, 220-221, 612, 612-13, 615 Program A (Addition, subtraction, and normalization), Program M (Floating point multiplication and division), #14, #15, #17
 Seth Kurtzburg 4.2.3 247-249, 249-250, 251-252, 618 Program A  (Double-precision addition), Program M (Double-precision multiplication), Program D  (Double-precision division), #6
 Steve Mann 4.3.1 266-267, 267-268, 269-270, 273-275, 623, 624, 625, 626 Program A (Addition of nonnegative integers), Program S (Subtraction of nonnegative integers), Program M (Multiplication of nonnegative integers), Program D (Division of nonnegative integers), #3, #8, #13, #25, #26
  4.4 320, 321, 637-638 Single-precision conversion (Methods 1a and 2a), #13
 Steve Mann 4.5.2 337,339 Euclid's algorithm, Binary gcd algorithm
 Seth Kurtzburg 3.2.1.1, 3.6 543, 544, 599 #2, #8, #1
  4.6.3 691 #2

Volume 3: Sorting and Searching, 2/e, First Printing March 1998

Volunteer Section Page Program Status

5.2 70-77, 616 Program C (Comparison counting), #9

5.2.1 81, 618-619 Program S (Straight insertion sort), #3

5.2.1 85 Program D (Shellsort)

5.2.1 97, 624-625 Program L (List insertion), #33

5.2.1 100, 625-626 Program M (Multiple list insertion), #35

5.2.2 107 Program B (Bubble sort)

5.2.2 117-118, 638 Program Q (Quicksort), #55

5.2.2 125-126 Program R (Radix exchange)

5.2.3 140, 640-641 Progarm S (Straight selection sort), #8

5.2.3 146-147 Program H (Heapsort)

5.2.4 165-166 Program L (List merge sort)

5.2.5 174 Program R (Radix list sort)
Keith Adams 6.1 397, 702 Program S (Sequential search), #3
Keith Adams 6.1 397-398 Program Q (Quick sequential search)
Keith Adams 6.1 398 Program Q' (Quicker sequential search)

6.2.1 411 Program B (Binary search)

6.2.1 415-416, 705 Program C (Uniform binary search), #10

6.2.1 418-419 Program F (Fibbonaccian search)

6.2.2 429 Program T (Tree search & insertion)
Philip H. Jensen 6.2.3 464-466 Program A (Balanced tree search & insertion)

6.3 493-494 Program T (Trie search)

6.4 523-524, 729 Program C (Chained hash table search & insertion), #12

6.4 527 Program L (Linear probing & insertion)

6.4 530 Program D (Open addressing with double hashing)

5 585-586 #8

5.2 617 #11

5.2.1 624 #31

5.2.2 629-630 #12

6.3 722 #9

Questions or comments? Please email the MMIXmaster Coordinator.


SourceForge Logo Valid HTML 4.01! Checked with LinkLink!