0 1 1 2 3 5 8 13 21 34 55 89 144 233 ........
斐波那契
遞歸
public
static
long
fibonicca(
n
)
// 計算斐波那契數的方法
{
if
(
== 0)
return
0;
else
== 1) {
1;
}
else
return fibonicca( n - 1) + fibonicca( n - 2);
尾遞歸
,
ret1
ret2
) {
ret1
;
- 1,
ret2
+
);
}