fibonacci 递归实现
摘要:fibonacci数列:1,1,2,3,5,8,13 … 给出来此数列的第N项递归算法。 private System.Int32 Fibonc(int n){ if (n < 3) { return 1; } else { return Fibonc(n-1) + Fibonc(n-2); }}
阅读全文
posted @ 2005-10-21 00:57
posted @ 2005-10-21 00:57
posted @ 2005-10-21 00:52
posted @ 2005-10-12 00:36