递归算法的一个例子

1,1,2,3,5,8,13,21,.... X(n为第n个数) 已知n,求X的值? 公式：(n=1,x=1 n=2,x=1 n>2,x=x(n-1)+x(n-2)) 采用递归算法 //1,1,2,3,5,8,13,21,....X(n) private int Get(int n) { int r = 0; if (n == 1 || n==2) { r = 1; } if (n > 2) { r = Get(n - 1) + Get(n - 2); } return r; } //测试结果: Response.Write("数列：Get(1)=" + Get(1)); Response.Write("数列：Get(2)=" + Get(2)); Response.Write("数列：Get(3)=" + Get(3)); Response.Write("数列：Get(4)=" + Get(4)); Response.Write("数列：Get(5)=" + Get(5)); Response.Write("数列：Get(6)=" + Get(6)); Response.Write("数列：Get(7)=" + Get(7)); Response.Write("数列：Get(8)=" + Get(8)); Response.Write("数列：Get(9)=" + Get(9)); Response.Write("数列：Get(10)=" + Get(10)); Response.Write("数列：Get(11)=" + Get(11)); //数列：Get(1)=1数列：Get(2)=1数列：Get(3)=2数列：Get(4)=3数列：Get(5)=5数列：Get(6)=8数列：Get(7)=13数列：Get(8)=21数列：Get(9)=34数列：Get(10)=55数列：Get(11)=89