冒泡排序

冒泡排序原理图

void sort() {
int[] ints = {3, 5, 8, 4, 7, 9, 2, 1, 36, 25, 4};
for (int i = 0; i < ints.length - 1; i++) {
for (int j = 0; j < ints.length - 1 - i; j++) {
if (ints[j] > ints[j + 1]) {
int temp = ints[j];
ints[j] = ints[j + 1];
ints[j + 1] = temp;
}
}
}
}