logo Practice-It logo

Main Page → Problems → Solve a Problem

recursionMystery1

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 mystery1(n) {
    if (n < 0) {
        return -mystery1(-n);
    } else if (n > 100) {
        return n;
    } else {
        return mystery1(n * 2);
    }   
}
mystery1(144);
mystery1(90);
mystery1(49);
mystery1(40);
mystery1(-10);

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.