Re:Ask HN: After SICP, what next?
by notaddicted on Friday May 15, 2009 @04:35PM
(#611302)
Yes, 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.
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.