C#简单案例（续1）冒泡排序

         **冒泡排序**
         *以下数据均可自由修改*
         **控制台自动排序不可输入**
       int[] b = { 1, 54, 64, 58, 59, 51, 24, 26 };
        for (int i = 0; i < b.Length - 1; i++)
        {
            for (int j = 0; j < b.Length - 1 - i; j++)
            {
                if (b[j] > b[j + 1])
                {
                    int c = b[j];
                    b[j] = b[j + 1];
                    b[j + 1] = c;
                }
            }
        }
        foreach (var item in b)
        {
            Console.WriteLine(item);
        }
        **可自由定义数组长度，数组元素**
        Console.WriteLine("请输入数组长度");
        int b = Convert.ToInt32(Console.ReadLine());
        int[] a = new int[b];
        Console.WriteLine("请输入" + b + "个元素");
        for (int i = 0; i < a.Length; i++)
        {
            a[i] = Convert.ToInt32(Console.ReadLine());
        }
        for (int i = 0; i < a.Length - 1; i++)
        {
            for (int j = 0; j < a.Length - 1 - i; j++)
            {
                if (a[j] > a[j + 1])
                {
                    int c = a[j];
                    a[j] = a[j + 1];
                    a[j + 1] = c;
                }
            }
        }
        Console.WriteLine("输出元素");
        foreach (var item in a)
        {
            Console.WriteLine(item);
        }