计算机程序设计艺术 卷一 1

P2

Euclid's algorithm: given 2 positive integers m and n, find their greatest common divisor

property of numbers:

1) if A can divide m and n, then A can divide m-n

2) 1) applies to m'<-n and n'<-m-n

the first n' that can divide m' has to be the greatest as n' is decreasing

P3

"m<-n" means that the value of variable m is to be replaced by the current value of variable n

-- m's original value is lost, there's no going back!

P6

the prove seems similar to the property

"The Programmer's Cookbook" -- no wonder so many 'cookbook's these days...