您好,这样:
这个事升序排列
int one = 0;
int two = 0;
int[] array = { 96,35,12,58,78,90,587,21,0,-64,106,52};
for (int i = 0; i < array.length - 1; i++) {
for (int j = i; j < array.length - i - 1; j++) {
one = array[j];
two = array[j + 1];
if (two < one) {
array[j + 1] = one;
array[j] = two;
}
}
}
温馨提示:答案为网友推荐,仅供参考