冒泡排序（C#版）

class Program
    {
        static void Main(string[] args)
        {
            int[] array = new int[10];
            int t;
            //随机产生10个数，并把这10个数存放到数组中
            Random random = new Random();
            for (int i = 0; i < array.Length; i++)
            {
                array[i] = random.Next(10, 100);
            }
            //通过循环输出没有排序之前的数
            Console.WriteLine("在没有排序之前，数组中的序列为：");
            for (int i = 0; i < array.Length; i++)
            {
                Console.Write(array[i]+"  ");
            }
            Console.WriteLine();
            //对数组中的数进行冒泡排序，每趟排序都能排出一个最大的数
            for (int i = 0; i < array.Length - 1; i++)
            {
                for (int j = 0; j < array.Length - 1 - i; j++)
                {
                    if (array[j] > array[j + 1])
                    {
                        t=array[j];
                        array[j]=array[j+1];
                        array[j + 1] = t;
                    }
                }
            }
            //最后通过循环输出排序后的结果
            Console.WriteLine("在排序之后，数组中的序列为：");
            for (int i = 0; i < array.Length; i++)
            {
                Console.Write(array[i]+"  ");
            }
            Console.ReadKey();
        }
    }