Java冒泡排序法

public class MySort {

public static void main(String[] args) {

MySort sort = new MySort();
int[] arr = new int[]{3,22,11,5,400,99,20,22,5};
sort.sort(arr);
for(int i : arr){
System.out.print(i+",");
}
}

public void sort(int[] targetArr){//小到大的排序

int temp = 0;
for(int i = 0;i for(int j = i;j

if(targetArr[i]>targetArr[j]){

/*//方法一：
temp = targetArr[i];
targetArr[i] = targetArr[j];
targetArr[j] = temp;

//方法二:
targetArr[i] = targetArr[i] + targetArr[j];
targetArr[j] = targetArr[i] - targetArr[j];
targetArr[i] = targetArr[i] - targetArr[j];*/

//方法三：
targetArr[i] = targetArr[i]^targetArr[j];
targetArr[j] = targetArr[i]^targetArr[j];
targetArr[i] = targetArr[i]^targetArr[j];

}

}
}
}

}
测试：
//拿8位来表示吧（正规32位）
Java代码

int a = 5, b = 3;
a = a + b;//8
b = a - b;//5
a = a - b;//3= 8 -5
System.out.println(a+" "+b);
//**********************************************************
int c=1;//000 000 01
int d=2;//000 000 10
c=c^d;//000 000 11 ---3
System.out.println(c);
d=c^d;//000 000 01 ----1
c=c^d;//000 000 10 ----2

System.out.println(c+" "+d);