recursionMysteryDivMod

This site requires JavaScript. It looks like you have disabled JavaScript in your browser or are using a browser that does not support JavaScript. Please enable it or try another browser.

< recursionMysteryComma

recursionMysteryMinus >

Main Page → Exercises → Java → Solve an Exercise

Language/Type: Java recursion

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

public static 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 method really doing?)

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

You must log in before you can solve this problem.

Need help?

Stuck on an exercise? Contact your TA or instructor.

Is there a problem? Contact us.

CodeStepByStep

Ad Blocker Detected

recursionMysteryDivMod