COSC 311   Quiz 2/5/2012

Trace the following recursive function: Give activation tree. 
As can be seen from the output below, f() is invokes 5 times, and
f(3, 2) returns a value of 9.

public class F {

public static int count = 0;

public static int f(int m, int n) {
    count++;
   if (m <= 0 || n <= 0 ) return 2;
   if (m == 1 || n == 1) return 3;
   return f( m - 1, n) + f(m, n-1);
   }
   
public static void main(String[] args) {
   int res;
   res = f(3, 2);
   
   System.out.println("count: " + count + "\tres: " + res);
}

}
   
   
   Output:  count: 5	res: 9