冒泡排序法 ，由小到大排列

int [] szA={35,24,414,315,93,91,12,13,149,15,984,222,451,241,55}; 
            
            for (int m = 0; m < szA.Length; m++)


            {
                
                 for (int n = m; n <szA.Length-1 ; n++)    
                 {
                    if (szA[n] >szA[n+ 1])

                     {
                         
                     int t = szA[n];

                         szA[n] = szA[n + 1]; 

                         szA[n + 1] = t;
                     }
                   
                 }
             }

            foreach(int i in szA)


             Console.WriteLine(i+" ");

           Console.ReadLine();

　　

转载于:https://www.cnblogs.com/suncan0/p/4716935.html