recursionMystery2

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.

< recursionMystery1

recursionMystery3 >

Main Page → Exercises → JavaScript → Solve an Exercise

Language/Type: JavaScript recursion mystery

Author: Melissa Hovik (on 2016/09/25)

For each call to the following function, indicate what value is returned:

function mystery2(n) {
    if (n < 0) {
        return -mystery2(-n);
    } else if (n < 10) {
        return (n + 1) % 10;
    } else {
        return 100 * mystery2(parseInt(n / 10)) + (n + 1) % 10;
    }   
}

`mystery2(7);`
`mystery2(42);`
`mystery2(385);`
`mystery2(-790);`
`mystery2(-89294);`

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

recursionMystery2