一个递归例子
public class recursion1{int fib(int n){ if(n == 0) return 0; else if(n == 1) return 1; else System.out.print(""+n);int a = fib(n-1);int b = fib(n-2);int c = a+b;System.out.print(" a="+a+" b="+b+" a+b= "+c+"\\ ");System.out.println();return fib(n-1) + fib(n-2);} public static void main(String args[]){ dgClass1 dg = new dgClass1();System.out.println(" 6="+dg.fib(6));//return 8}}
页:
[1]