冒泡排序
算法思路:
每次尝试找到当前待排序区间中最小(或最大)的元素,放到数组最前面(或最后面)
import java.util.Arrays;
public class Test {
public static void main(String[] args) {
int[] arr = {9,5,2,7};
bubbleSort(arr);
System.out.println(Arrays.toString(arr));
}
public static void bubbleSort(int[] arr) {
for (int bound = 0; bound < arr.length; bound++) {
for (int cur = arr.length - 1;cur > bound; cur--) {
if (arr[cur - 1] > arr[cur]) {
int tmp = arr[cur - 1];
arr[cur - 1] = arr[cur];
arr[cur] = tmp;
}
}
}
}
}
运行结果