冒泡排序

int[]  arr={5,8,9,3,2,1,6,7};
System.out.println("排序前数组为:");
for (int num:arr){
System.out.println(num + " ");
}
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j+1]) {
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
}
}
System.out.println();
System.out.println("排序后的数组为:");
for (int num:arr) {
System.out.println(num+" ");
}
}
posted @ 2019-06-03 16:16  lijiyang  阅读(110)  评论(0编辑  收藏  举报