3 ms·
Sorry if this seems dense but I can't reconcile what your saying and I've not read the book. You say: > It's actually a common misconception that Knuth uses M
by chollida1 18y ago
Sorry if this seems dense but I can't reconcile what your saying and I've not read the book. You say:
> It's actually a common misconception that Knuth uses MIX/MMIX to implement his algorithms.
So you state very clearly that he doesn't use MIX to code his algorithms.
But then you say:
> and the MMIX implementation is usually only given when there are relevant implementation details to be discussed
So you say that he does actually use the MIX language.
Do you mean that most algorithms aren't presented in source form at all and only the few that are actually coded are in the MIX language?
- notaddicted 18y agoYes, that is how it is. For example the first algorithm in the book (found via google): Algorithm E ( Euclid's algorithm). Given two positive integers m and n, find their greatest common divisor, that is, the largest positive integer that evenly divides both m and n. E1 [Find remainder.] Divide m by n and let r be the remainder. (We will have 0 ≤ r < n) E2 [Is it zero?] If r=0, the algorithm terminates: n is the answer. E3 [Reduce.] Set m← n, n← r, and go back to step E1.
- chollida1 18y agoThanks for the clarification:)
- gilesgoatboy 18y agoIf you're going to do Euclid's algorithm, cut to the chase and read Euclid. Nothing will ever teach you more about logic.