public static int f(int x){
if (x==10) return 10;
System.out.println(“x: ” +x );
return x+ f(x+1);
}
public static void main(String[] args) {
System.out.println(“f(X) : ” + f(0));
}
x: 0
x: 1
x: 2
x: 3
x: 4
x: 5
x: 6
x: 7
x: 8
x: 9
f(X) : 55
BUILD SUCCESSFUL (total time: 0 seconds)
Fibonacci Recursive
public static int fib(int x){
if (x==1) return 1;
if (x==0) return 1;
return fib(x-1)+fib(x-2);
}
public static void main(String[] args) {
System.out.println(fib(10));
}
run:
89
BUILD SUCCESSFUL (total time: 0 seconds)
Agile Method 