C#冒泡排序小试

 int[] PaoPAo = new int[10] { 88, 56, 91, 55, 74, 6, 35, 58, 45, 32 };
            for (int i = 0; i < PaoPAo.Length-1; i++)
            {
                for (int j = 0; j < PaoPAo.Length-1-i; j++)
                {

                  if (PaoPAo[j]>PaoPAo[j+1])
                       {
                            int temp=PaoPAo[j];
                            PaoPAo[j] = PaoPAo[j + 1];
                            PaoPAo[j + 1] = temp;   
                          }
                    foreach (int  x in PaoPAo)
            {
                Console.Write(x+" ");
            }
                    Console.WriteLine("比较{0}次的结果：", j + 1);
                }

                Console.WriteLine("第{0}次确定最大值",i+1);
                foreach (int x in PaoPAo)
                {
                    Console.Write(x + " ");
                }
                Console.WriteLine(""); 
            }

            Console.WriteLine();
            foreach (int  x in PaoPAo)
            {
                Console.Write(x+" ");
            }
           

参考一下运行结果，你估计就会慢慢了解了