C# 排列组合

using System;
using System.Linq;
using System.Text;
using System.Collections;

namespace _7_3
{
    class Traveling
    {
        int sum = 0;
        public int Tsp(int[] list, int start, int end)//递归的产生全排列 list 存数组 start 开始位置 end总数
        {          
            if (start == end)
            {
                for (int i = 0; i < end; i++)
                {
                    Console.Write(list[i]+"--> ");
                }
                Console.WriteLine();
                sum++;
            }
            else
            {
                for (int i = start; i < end; i++)
                {
                    Swap(ref list[start], ref list[i]);//交换位置
                    Tsp(list, start + 1, end);
                    Swap(ref list[start], ref list[i]);//交换位置
                }
            }
            return sum;
        }
        public void Swap(ref int a, ref int b) //ref 传值
        {
            int temp;
            temp = a;
            a = b;
            b = temp;
        }
    }
    class Program
    {
        static void Main(string[] args)
        {
            int n;
            int sum = 1;
            n = Convert.ToInt32(Console.ReadLine());
            int[] set = new int[n];
            for (int i = 0; i < n; i++)
            {
                    set[i] = i+1;
            }
            Traveling tl = new Traveling();
            sum=tl.Tsp(set, 0, n);
            Console.WriteLine("总共" + sum + " 种");
            Console.ReadLine();
        }      
    }
}