01 冒泡排序
冒泡排序:两层循环,外层冒泡轮数,里层依次比较。
public class Hello {
public static void main(String[] args) {
int[] a = {1, 2, 3, 8, 11, 1, 55, 12};
int[] array = sort(a);
System.out.println(Arrays.toString(array));
}
public static int[] sort(int[] array) {
int temp = 0;
for (int i = 0; i < array.length - 1; i++) {
boolean flag = false;
for (int j = 0; j < array.length - 1; j++) {
if (array[j + 1] < array[j]) {
temp = array[j + 1];
array[j + 1] = array[j];
array[j] = temp;
flag = true;
}
}
if (flag == false) {
break;
}
}
return array;
}
}