冒泡排序
public class BubbleSort {
public static void main(String[] args) {
int[] arr = {55, 4, 7, 88, 15, 3};
sort(arr);
sortImprove(arr);
}
public static void sort(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - 1; j++) {
if (arr[j] > arr[j + 1]) {
swap(arr, j, j + 1);
}
}
}
System.out.println(Arrays.toString(arr));
}
public static void sortImprove(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
boolean isSort = false;
for (int j = 0; j < arr.length - 1; j++) {
if (arr[j] > arr[j + 1]) {
swap(arr, j, j + 1);
isSort = true;
}
}
System.out.println(Arrays.toString(arr));
if (isSort == false)
return;
}
System.out.println(Arrays.toString(arr));
}
public static void swap(int[] arr, int i, int j) {
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}