RecursionHW 1/12/16
123456789101112131415161718192021222324252627282930313233343536373839404142434445
import java.util.*;
class Main {
private static int count1 = 0;
private static int count2 = 0;
public static void main(String[] args)
{
System.out.println(choose1(4, 2));
System.out.println(count1);
System.out.println(choose2(4, 2));
System.out.println(count2);
}
public static int choose1(int n, int k)
{
count1++;
if(k == 0)
{
return 1;
}
else
{
return choose1(n, k-1) * (n-k+1)/k;
}
}
public static int choose2(int n, int k)
{
count2++;
if(k < 0 || k > n)
{
return 0;
}
else if (n == 0)
{
return 1;
}
else
{
return choose2(n-1, k-1) + choose2(n-1, k);
}
}
}
Java
INFO