logo Practice-It logo

Main Page → Problems → Solve a Problem

Recursive Tracing

Language/Type: Java recursion recursive tracing
Author: Stuart Reges (on 2014/02/13)

Consider the following method: 

    public void mystery(int n) {
        if (n % 2 == 1)
            System.out.print(n);
        else {
            System.out.print(n + ", ");
            mystery(n / 2);
        }
    }

For each call below, indicate what output is produced:

mystery(13);
mystery(42);
mystery(40);
mystery(60);
mystery(48);

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.