1. main calls printNum()

2. printNum() Call divRem()

3. Stack after return from divRem()

4. printNum() recursively calls printnum()

5. printNum() calls divRem()

6. Stack after return from divRem()

7. How long do you keep going ?

• How could you tell if there are more recursive calls?
• When the recursion is complete, what holds the digit to be printed?
• How can you convert that value to ASCII?
• How do you printh the ASCII?

8. printNum() calls getDigit()

9. just after return