C# 两个数组合并 并排序

            int[] a = new int[] { 1, 7, 15, 4, 5, 6, 7 };
            int[] b = new int[] { 8, 9, 10, 11, 12, 13 };
            int[] c = new int[a.Length + b.Length];
            a.CopyTo(c, 0);
            b.CopyTo(c, a.Length);
            int temp;
            for (int i = 0; i < c.Length - 1; i++)
            {
                for (int j = i + 1; j < c.Length; j++)
                {
                    if (c[i] < c[j])  //从大到小
                    {
                        temp = c[i];
                        c[i] = c[j];
                        c[j] = temp;
                    }
                }
                Console.WriteLine(c[i]);
            }