logo Practice-It logo

Main Page → Problems → Solve a Problem

Recursive Tracing

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

Consider the following method: 

    public static void mystery(int n) {
        if (n < 0) {
            mystery(-n);
        } else if (n < 10) {
            System.out.print(n);
        } else {
            mystery(n / 10);
            int digit = n % 10;
            System.out.print(", " + digit % 3);
        }
    }

For each call below, indicate what output is produced:

mystery(7);
mystery(38);
mystery(749);
mystery(-6842);
mystery(954023);

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.