The execution process of "algorithm" small recursive function

The function of the following program is to use recursion to deposit an integer into an array of characters. Store in reverse order. If 483 stores into 384

The program itself is not difficult, take it out is to help understand the recursive implementation process.

#include "stdio.h" 
void convert (char *a,int N)
{
    int i;
    if ((I=N/10)!=0)    
        convert (a+1,i);    or change to convert ((a++,a--), i);

    *a= n%10+ ' 0 ';
    printf ("%c\n", *a);
}
void Main ()
{ 
    int number;
    Char str[10]= "    ";
    scanf ("%d", &number);
    Convert (str,number); 
    Puts (str);

Run Result: