擅长排列的小明（acm算法题）

using System;

namespace cchoop
{
    class Program
    {
        static int num1 = 5;
        static int num2 = 2;
        static int[] arr;
        public static void Main()
        {
            arr = new int[num2];

            Test(num1, num2);
        }


        //4 3
        static void Test(int temp1, int temp2)
        {
            if (temp2 == 0)
            {
                for (int i = 0; i < num2; i++)
                {
                    Console.Write(arr[i]);
                }
                Console.WriteLine();
                return;
            }

            for (int i = 1; i <= temp1; i++)
            {
                bool flag = true;
                for (int j = 0; j < num2 - temp2; j++)
                {
                    if (arr[j] == i)
                    {
                        flag = false;
                        break;
                    }
                }
                if (flag)
                {
                    arr[num2 - temp2] = i;
                    Test(temp1, temp2 - 1);
                }
            }
        }
    }
}

---