递归操作（未完成）

   例1： 阶乘函数

public int factorial(int x){ if(x == 1) return 1; else return x * factorial(x - 1); } 

   其中x 为任意的正整数，例x=4时，为了简洁用f(x)代替factorial(x)

                          f(4) = 4 * f(3) = 4 * 3 * 2 * f(1) = 4! = 24

 

      例2:对非负整数x和y的最大公约数g(x,y)

  public int g(int x, int y){ if(x = 0) return y; else if(y < x) return g(y,x); else return g(x,y-x); }

   其中x>0,y>0,且x,y不同时为0. g(8,4)=g(4,8)=g(4,4)=g(4,0)=g(0,4)=4

 

    例3: Fibonacci 函数

      public int f(int x){ if(x == 0) return 0; else if(x == 1) return 1; else return f(x - 1) + f(x - 2); }

   其中,x为非负整数

    f(0) = 0

    f(1) = 1

    f(2) = f(1) + f(0) = 1

    f(3) = f(2) + f(1) = 2

    .......

    f(5) = f(4) + f(3) = 3 + 2 =5

 

例4: 计算x^y

                        1     y=0

  f(x,y) = x^y= {  (x*x)^y/2      y为偶数 

                         x^y-1*x        y为奇数

 

 public int f(int x, int y){ if(y == 0) return 1; else if(y%2 != 0) return f(x*y,y/2); else return f(x,y-1)*y; }             

     f(4,3) =f(4,2)*4 = f(16,1)*4 = F(16,0)*64 = 1*64 =64