15.冒泡排序、选择排序（升序排序，降序排序）
1.选择排序
int[] arr = {1,8,6,3,9,5,4,7,11};
int[] brr = {1,8,6,3,9,5,4,7,11};
int[] crr = {1,8,6,3,9,5,4,7,11};
int[] drr = {1,8,6,3,9,5,4,7,11};
System.out.println("==================选择排序(左小右大)============================");
System.out.println("方法1.");
for(int i=0; i arr[j]){
int c = arr[i];
arr[i] = arr[j];
arr[j] = c;
}
}
System.out.print("外循环打印第"+(i+1)+"次：");
for(int ii=0;ii 0; i--){
for(int j=i-1; j>0; j--){
if(brr[i] < brr[j]){
int c = brr[i];
brr[i] = brr[j];
brr[j] = c;
}
}
System.out.print("外循环打印第"+(brr.length-i)+"次：");
for(int ii=0;ii 0; i--){
for(int j=i-1; j>=0; j--){
if(drr[i] > drr[j]){
int c = drr[i];
drr[i] = drr[j];
drr[j] = c;
}
}
System.out.print("外循环打印第"+(brr.length-i)+"次：");
for(int ii=0;ii 打印结果：
2.冒泡排序
int[] arr = {1,8,6,3,9,5,4,7,11};
int[] brr = {1,8,6,3,9,5,4,7,11};
int[] crr = {1,8,6,3,9,5,4,7,11};
int[] drr = {1,8,6,3,9,5,4,7,11};
System.out.println("==================冒泡排序(左小右大)============================");//升序排序
System.out.println("方法1.");
for(int i=0; ii; j--){
if(arr[j-1] > arr[j]){
int c = arr[j-1];
arr[j-1] = arr[j];
arr[j] = c;
}
}
System.out.print("外循环打印第"+(i+1)+"次：");
for(int ii=0;ii 0; i--){
for(int j=0; ji; j--){
if(arr[j-1] < arr[j]){
int c = arr[j-1];
arr[j-1] = arr[j];
arr[j] = c;
}
}
System.out.print("外循环打印第"+(i+1)+"次：");
for(int ii=0;ii 0; i--){
for(int j=0; j 打印结果：
