C#基础-九九乘法表和冒泡排序

//乘法表
            for (int i = 1; i < 10; i++)//行
            {
                for (int j = 1; j < 10; j++)//列
                {
                    if (j <= i)
                    {
                        Console.Write("{0}*{1}={2}	", j, i, j * i);//列在前行在后，小的在前大的在后加上制表符
                    }
                }
                Console.WriteLine();
            }
            Console.ReadKey();

#region 复习冒泡排序
            int[] arrayint = { 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29 };
            for (int i = 0; i < arrayint.Length - 1; i++)
            {
                for (int j = 0; j < arrayint.Length - 1 - i; j++)
                {
                    if (arrayint[j] < arrayint[j + 1])
                    {
                        int temp = arrayint[j];
                        arrayint[j] = arrayint[j + 1];
                        arrayint[j + 1] = temp;
                    }
                }
            }
            foreach (int item in arrayint)
            {
                Console.WriteLine(item);
            }
            Console.ReadKey();
            #endregion