public static void main(String[] args) {
//冒泡算法思想,双重遍历,外层遍历整个数组,内层遍历还没排序好的一部分
//数组
Integer[] ints = new Integer[]{82, 69, 75, 89, 90, 87, 55, 67, 99, 100, 80};
//双重遍历
for (int i = 0; i < ints.length - 1; i++) {
for (int j = i + 1; j < ints.length; j++) {
if(ints[i] > ints[j]){
//不通过介质,改变两个变量的值
ints[i] = ints[i] ^ ints[j];
ints[j] = ints[i] ^ ints[j];
ints[i] = ints[i] ^ ints[j];
}
}
}
//输出结果
for (Integer integer : ints) {
System.out.print(integer + " ");
}
}