Concrete Math.(具体数学)
mach7
nil
展开
-
1.1 The Tower of Hanoi
Let Tn denote the minimum necessary steps to move n disks from one peg to another. The base cases are trivial: T0=0, T1=1, T2=3. To move n disks from peg1 to peg3, first move n-1 disks from pe原创 2014-05-03 00:55:41 · 998 阅读 · 1 评论 -
1.2 Lines in the plane
原创 2014-05-04 11:21:34 · 918 阅读 · 0 评论