public class Recursive01 {
public static void main(String
[] args
) {
int i
= functionB(4);
System
.out
.println(i
);
}
public static int functionA(int n
){
if (n
==0){
return 1;
}
else {
return (int) (functionA(n
-1)+Math
.pow(10,n
));
}
}
public static int functionB(int n
){
if (n
==0){
return 1;
}else {
return functionB(n
-1)+functionA(n
);
}
}
}
Processed:
0.019, SQL:
10
