选择排序和冒泡排序

选择排序，设个数为N

for( int i=0; i<N-1; i++)

      for( int j=i+1; j<N; j++)

             if( a[i]<a[j] )

                   {

                t=a[i];

                 a[i]=a[j];

                 a[j]=t;

            }

 

 

冒泡排序：

       for(int i=0; i<N-1; i++)

           for(int j=0; j<N-i-1; j++)

             if(a[j]<a[j+1])

                {

                   t=a[j];

                   a[j]=a[j+1];

                   a[j+1]=t;

                  }