冒泡排序的几种排序方式

冒泡排序的几种排序方法：

    int[] scores={15,45,25,5,48,90};

    for(int i=0;  i<scores.length-1; i++){

        for(int j=0; i<scores.length-1-i; j++){

            if(scores[j]>scores[j+1]){

                //借助第三方变量        

                /*int c=scores[j];

                   scores[j]=scores[j+1] ;

                   scores[j+1] =c;*/

                //不借助第三方变量

                /*scores[j]=scores[j+1] ;

                scores[j+1]=scores[j]-scores[j+1]         

                scores[j]=scores[j]-scores[j+1] ;*/

                //异或：一个数异或同一个数两次等于它本身

                scores[j]=scores[j]^scores[j+1];

                scores[j+1]=scores[j]^scores[j+1];

                scores[j]=scores[j]^scores[j+1];

            }

        }

    }

    for(int i=0;  i<scores.length; i++){

            System.out.print(scores[i]+"\t");

    }

小公式：********************************************

    //借助第三方变量

    c=a;

    a=b;

    b=a;

    //不借助第三方变量

    a=a+b;

    b=a-b;

    a=a-b;

    //异或

    a=a^b;

    b=a^b;

    a=a^b;