【2017-3-1】冒泡排序

冒泡排序

依次比较相邻的两个数，将小数放在前面，大数放在后面。

 

数组中两个变量进行交换                                         //对数组中两个变量进行交换，是冒泡排序中最基本的步骤

         int [] s = new int[]{1,5,7};

         int  a = s [0]; 

         s [0] = s [s.Length-1];

         s [s.Length-1] = int a ;

         for (int i =0;i<s.Length;i++);

         { 

                 Console.WriteLine(s[i]);

          }

 

 

    冒泡排序                                                                //冒泡排序最基本的格式，格式固定，很重要，记住                                                

                    int [ ] ss = new int[ ]{2,1,5,3,4};

                    int  temp;

                    for ( int i = 0 ; i < ss.Length ; i ++ )                    //抽取第一个变量    

                   {

                        for ( int j = i + 1 ; j < ss.Length ; j++  )           // 抽取第二个变量             

                        {

                              if ( ss[ i ]< ss[ j ]    )                                //比较，交换位置

                              {

                                     temp = ss[ i ];                                     

                                     ss[ i ]= ss[ j ];

                                     ss[ j ];=temp;

                                }

                          }

                      }

                      for( int i <0 ; i< ss.Length ; i++ )                         // 输出 

                    {

                         Console.WriteLine(  ss [ i ] );

                      }

                      Console.ReadLine();