马上注册,结交更多好友,享用更多功能^_^
您需要 登录 才可以下载或查看,没有账号?立即注册
x
import java.util.Arrays;
public class ArraysDemon07 {
public static void main(String[] args) {
int[] a = {4,34,5,234,986,865};
int[] maoPao = maoPao(a);
System.out.println(Arrays.toString(a));
}
//冒泡排序
public static int[] maoPao(int[] array) {
int c = 0;
for (int i = 0; i < array.length - 1; i++) {
for (int j = 0; j < array.length - i; j++) {
if (array[j + 1] > array[j]) {
c = array[j];
array[j] = array[j + 1];
array[j + 1] = c;
}
}
}
return array;
}
}
你冒泡排序第二个 for 循环需要 -1 ,否则就会导致第一次循环超出索引
参考代码:
package pers.uang;
import java.util.Arrays;
public class ArraysDemon07 {
public static void main(String[] args) {
int[] a = {4,34,5,234,986,865};
int[] maoPao = maoPao(a);
System.out.println(Arrays.toString(a));
}
//冒泡排序
public static int[] maoPao(int[] array) {
int c = 0;
for (int i = 0; i < array.length - 1; i++) {
for (int j = 0; j < array.length - i - 1; j++) {
if (array[j + 1] > array[j]) {
c = array[j];
array[j] = array[j + 1];
array[j + 1] = c;
}
}
}
return array;
}
}
|