C#冒泡排序法

using System.Text;

namespace GanggangApplication
{
    class Program
    {
        static void Main(string[] args)
        {
            SortedNumbers();
        }

        /// <summary>
        /// 該方法獲得需要排序的數組，表調用排序方法進行排序
        /// </summary>
        public static void SortedNumbers()
        {
            int numberCount;
            int[] numbers;
            Console.WriteLine("－－－－－－－－－－剛剛冒泡排序法－－－－－－－－－－");
            Console.WriteLine("請問您要對多少爲數字進行排序？");
            numberCount = Convert.ToInt32(Console.ReadLine());
            numbers = new int[numberCount];
            Console.WriteLine("請輸入您要進行排序的這{0}個數字：",numberCount);
            for (int i = 0; i < numberCount; i++)
            {
                numbers[i] = Convert.ToInt32(Console.ReadLine());
            }

            Console.WriteLine("\n您要進行排序的{0}個數字分別爲：",numberCount);
            for (int i = 0; i < numberCount; i++)
            {
                Console.Write(numbers[i].ToString() + "\t");
            }

            Console.WriteLine("\n您要對這{0}個數字進行什麼排序？(1表示升序,2表示降序)",numberCount);
            int method = Convert.ToInt32(Console.ReadLine());

            while (method != 1 && method != 2)
            {
                Console.WriteLine("只能輸入1或者2，請您重新輸入！");
                method = Convert.ToInt32(Console.ReadLine());
            }

            //調用排序方法
            ExecuteSortedMethod(numbers, method);

            Console.WriteLine("排序後的結果爲：");
            for (int i = 0; i < numberCount; i++)
            {
                Console.Write(numbers[i].ToString() + "\t");
            }
            Console.WriteLine("\n－－－－－－－－－－剛剛冒泡排序法－－－－－－－－－－");
            Console.ReadKey();
        }

        /// <summary>
        /// 接受數字參數和排序方法參數，進行冒泡排序
        /// </summary>
        /// <param name="num">要進行排序的整數數組</param>
        /// <param name="sortedMethod">排序方法標識：1爲升序，2爲降序</param>
        public static void ExecuteSortedMethod(int[] num, int sortedMethod)
        {
            if (sortedMethod == 1)      //升序排列
            {
                for (int i = 0; i < num.Length -1; i++)
                {
                    for (int j = 0; j < num.Length - 1 - i; j++)
                    {
                        if (num[j] > num[j + 1])
                        {
                            int temp = num[j];
                            num[j] = num[j + 1];
                            num[j + 1] = temp;
                        }
                    }
                }
            }
            if (sortedMethod == 2)      //降序排列
            {
                for (int i = 0; i < num.Length - 1; i++)
                {
                    for (int j = 0; j < num.Length - 1 - i; j++)
                    {
                        if (num[j] < num[j + 1])
                        {
                            int temp = num[j];
                            num[j] = num[j + 1];
                            num[j + 1] = temp;
                        }
                    }
                }
            }
        }

    }
}