The C recursive implementation puts an integer into an array in reverse order

This article describes the C# recursive implementation of the 1 integer after the reverse order into the 1 array method, to share for your reference. Specific implementation methods are as follows:

static void Main(string[] args)

{

    int m = 1236578;

    int[] ms = new int[m.ToString().Length];

    Rev(m.ToString().Length, m, ref ms);

    for (int i = 0; i < m.ToString().Length; i++)

 Console.Write("{0}", ms[i]);

    Console.ReadLine();

}
private static void Rev(int len, int m, ref int[] ms)

{

    if (m / 10 > 0)

    {

 ms[len - m.ToString().Length] = m % 10;

 Rev(len, m / 10, ref ms);

 return;

    }

    ms[len - m.ToString().Length] = m % 10;

}

Hopefully this article has helped you with your C# programming.