冒泡排序
public class MaoPaoPaiXu {
public static void main(String[] args) {
int[] arr = new int[]{1, 2, 45, 7, 5};
XuanZe(arr, arr.length);
for (int i = 0; i < arr.length; i++) {
System.out.println(arr[i]);
}
}
public static void XuanZe(int[] arr, int end) {
for (int i = 0; i < end; i++) {
for (int j = i + 1; j < end; j++) {
if (arr[i] > arr[j]) {
int tmp = arr[i];
arr[i] = arr[j];
arr[j] = tmp;
}
}
}
}
}