Question: ** RECURSION *** #include using namespace std; int funcB(int); int funcA(int n) { if (n

** RECURSION ***

#include  using namespace std; int funcB(int); int funcA(int n) { if (n <= 1) return 1; else return n + funcB(n - 2); } int funcB(int n) { if (n <= 3) return 1; else return n * funcA(n - 3); } int main() { int num = 11; cout << funcA(num); return 0; }

// I know the output is 101, but can someone show the process/work on how to get that answer?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!