算法相关
yinbodotcc
基础和内核很重要---能力构成
展开
-
汉诺塔(Towers of Hanoi)问题
算法: Procedure HANOI(n, A, B, C) [ IF(n == 1) [ PRINT("Move sheet " n " from " A " to " C); ] ELSE [ HANOI(n-1, A, C, B); PRINT("Move sheet " n " from " A " to " C);原创 2007-01-27 23:05:00 · 1203 阅读 · 0 评论 -
Fibonacci数列 杨辉三角
非递归算法:Procedure FIB(N) a = 1; b = 1; FOR i = 2 TO N [ temp = b; b = a + b; a = temp; ] RETURN b; ] 杨辉三角的过程是: 0C0 1C0 1C1 2C0 2C1 2C原创 2007-01-27 23:12:00 · 932 阅读 · 0 评论