package com.xiaobaizhiqian;
/**
* 冒泡排序
* @author Administrator
*/
public class BubbleSort {
public static void main(String[] args) {
int arr[] = { 26, 15, 29, 66, 99, 88, 36, 77, 111, 1, 6, 8, 8 };
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - 1; j++) {
if (arr[j] > arr[j + 1]) {
// 以下代码片段实现了不通过中间变量交换两个变量的值
arr[j] = arr[j + 1] + arr[j];
arr[j + 1] = arr[j] - arr[j + 1];
arr[j] = arr[j] - arr[j + 1];
}
}
}
for (int i : arr) {
System.out.println(i);
}
}
}
源码下载:https://pan.baidu.com/s/1UXAPsOjERHhdwC0QXB8sow