冒泡排序

思想：越小的元素会经由交换慢慢“浮”到数列的顶端，故名 冒泡排序。

写方法体代码

       /// <summary>

       /// 冒泡排序

       /// </summary>

       /// <param name="numbers">待排序的数组名称</param>

        public static void BubbleSort(int[] numbers)

        {

            for (int i = numbers.Length - 1; i > 0; --i)//遍历的次数

            {

                for (int j = 0; j < i; ++j)//比较值的大小

                {

                    if (numbers[j + 1] < numbers[j])

                    {

                        Swap(numbers, j, j + 1);

                    }

                }

            }

        }

使用冒泡排序

static void Main(string[] args)

        {

            int[] numbers = { 49, 38, 65, 55,97, 76, 13, 27 ,55};

            Console.WriteLine("--------------" + "排序前" + "----------------");

            foreach (int r in numbers)

            {

                Console.Write(r.ToString()+" ");

            }

            Console.WriteLine();//起换行作用

            BubbleSort(numbers);

            Console.WriteLine("--------------" + "排序后" + "----------------");

            foreach (int r in numbers)

            {

                Console.Write(r.ToString()+" ");

            }

            Console.WriteLine();

        }

都不想都打字了！还是那句话！有图有真相！