/**
* 作者:liujian on 2019/3/8 13:21
* 邮箱:15313727484@163.com
* 冒泡排序
*/
public class Bubbling {
public static void main(String[] args) {
//数据源
int[] data = {2, 5, 1, 9, 4, 7, 5, 8, 2, 3, 4, 10, 40, 50, 20, 23, 21, 54, 45, 65, 43, 34};
//冒泡排序算法
sort(data);
for(int i = 0;i<data.length;i++){
System.out.print(data[i]+",");
}
}
private static void sort(int[] data) {
for (int p = 1; p < data.length; p++) {
for (int j = 0; j < data.length - p; j++) {
if (data[j] > data[j + 1]) {
//交换一下
data[j] = data[j] ^ data[j + 1];
data[j + 1] = data[j] ^ data[j + 1];
data[j] ^= data[j + 1];
}
}
}
}
}