The Art of Computer Programming (acronym: TAOCP) is a comprehensive monograph written by Donald Knuth that covers many kinds of programming algorithms and their analysis.

learn more… | top users | synonyms

1
vote
1answer
346 views

Assembly vs. algorithmic languages (like C, Algol, etc) [duplicate]

Usually, computer science papers describe algorithms in Algol-like pseudolanguage, similar to Pascal or even C/C++. But Donald Knuth uses his own assembly language (MMIX). Are there any good known ...
5
votes
1answer
189 views

Problem in Understanding Algorithm from TAOCP “Multiply Permutations in Cycle Form”

I am not able to understand one algorithm discussed in TAOCP Volume 1; Section 1.3.3 named as "Algorithm A" stated as "Multiply permutations in cycle form" while compared with the stated example in ...
16
votes
4answers
6k views

Why does Donald Knuth write TAOCP using assembly language?

I don't hate using assembly language, since I have written some in my os course. But obviously, assembly language lacks abstraction, you have to pay more attention to the details. Is assembly ...
9
votes
2answers
618 views

Is this statement from Knuth's fundamental algorithms still applicable today? [closed]

In a sense, 10! (ten factorial) represents an approximate dividing line between things which are practical to compute and things which are not. This is from Knuth's TAOCP Fundamental ...
2
votes
2answers
354 views

In Knuth's MMIX, how can x be an octabyte (64 bits) and M[x] be a byte (8 bits)?

In Knuth's Fascicle 1 on MMIX, the "Memory and Registers" section on page 4 states: "thus if x is any octabyte, M[x] is a byte of memory." and "thus if x is any byte, $x is an octabyte." How can x ...