C#冒泡排序算法实现

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
/********冒泡排序算法*********/
namespace MaoPaoApplication
{
    class Program
    {
        static void Main(string[] args)
        {
            SortedNumbers();
        }


        public static void SortedNumbers()
        {
            int numberCount = 1;//默认升序
            int arryLength;  //声明数组长度变量
            Console.WriteLine("－－－－－－－－－－冒泡排序法－－－－－－－－－－");
            Console.WriteLine("请问输入你想要排序的数组：");


            string s = Console.ReadLine();
            arryLength = s.Length;
            char [] chars=s.ToCharArray();
           


            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(chars, method);


            Console.WriteLine("排序后的结果为：");
            for (int i = 0; i < numberCount; i++)
            {
                Console.Write(chars[i].ToString() + "\t");
            }
            Console.WriteLine("\n－－－－－－－－－－刚刚冒泡排序法－－－－－－－－－－");
            Console.ReadKey();
            


        }
        /// <summary>
        /// 排序算法
        /// </summary>
        /// <param name="num"></param>
        /// <param name="sortedMethod"></param>
        public static void ExecuteSortedMethod(char[] num, int sortedMethod)
        {
            //升序排列
            if (sortedMethod == 1)
            {
                for (int i = 0; i < num.Length; i++)
                {
                    for (int j = 0; j < num.Length - 1 - i; j++)
                    {
                        if (num[j] > num[j + 1])
                        {
                            char temp = num[j];
                            num[i] = 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])
                        {
                            char temp = num[j];
                            num[j] = num[j + 1];
                            num[j + 1] = temp;
                        }
                    }
                }
            }
        }
    }
}