logo Practice-It logo

Main Page → Problems → Solve a Problem

recursionMystery2

Language/Type: JavaScript recursion mystery
Author: Melissa Medsker-Galloway (on 2016/11/18)

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.


Log In

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.