logo CodeStepByStep logo

recursionMysteryDivMod

Language/Type: C++ recursion
Author: Marty Stepp (on 2016/07/03)

For each call to the following recursive function, write the value that would be returned.

int recursionMysteryDivMod(int n) {
    if (n < 0) {
        return recursionMysteryDivMod(-n);
    } else if (n < 10) {
        return n;
    } else {
        return n % 10 + recursionMysteryDivMod(n / 10);
    }
}

(Side note: What is the function really doing?)

recursionMysteryDivMod(8)
recursionMysteryDivMod(74)
recursionMysteryDivMod(-513)
recursionMysteryDivMod(3052)
recursionMysteryDivMod(82534)

You must log in before you can solve this problem.


Log In

Need help?

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.

© Marty Stepp, all rights reserved.