C# -- 冒泡排序

C# -- 冒泡排序

1. C#代码

            int[] num = { 3, 5, 7, 1, 2, 13, 9, 4, 6, 11, 22, 44, 33, 14, 43, 41, 5, 868, 476, 34535, 345, 46, 47, 47, 848 };
            for (int i = 0; i < num.Length - 1; i++)
            {
                for (int j = num.Length - 1; j > i; j--)
                {
                    if (num[j] < num[j - 1])
                    {
                        int temp = num[j];
                        num[j] = num[j - 1];
                        num[j - 1] = temp;
                    }
                }
            }
            Console.WriteLine("排序后的数组：");
            for (int k = 0; k < num.Length; k++)
            {
                Console.Write("{0},", num[k]);
            }

            Console.ReadKey();

 2. 运行结果：