recursionMystery1

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.

< printStars

recursionMystery2 >

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 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.

Need help?

Stuck on an exercise? Contact your TA or instructor.

Is there a problem? Contact us.

CodeStepByStep

Ad Blocker Detected

recursionMystery1