.Net随笔：C#冒泡排序

 #region 冒泡排序
        public static void Sort(int[] array)
        {
            int i, j;  // 循环变量
            int temp;  // 临时变量
            for (i = 0; i < array.Length - 1; i++)
            {
                for (j = 0; j < array.Length - 1 - i; j++)
                {
                    if (array[j] > array[j + 1])
                    {
                        // 交换元素
                        temp = array[j];
                        array[j] = array[j + 1];
                        array[j + 1] = temp;
                    }
                }
               
            }