第1个回答 2016-03-29
int[] arr = { 1, 3, 2, 6, 4, 5 };
int n = arr.length;
int temp;
for (int i = 1; i <= n - 1; i++) {
for (int j = n - 1; j >= 1; j--) {
if (arr[j] > arr[j - 1]) {
temp = arr[j];
arr[j] = arr[j - 1];
arr[j - 1] = temp;
}
}
}
System.out.println("降序排序后:");
for (int i = 0; i < n; i++) {
System.out.print(" " + arr[i]);
}
for (int i = 1; i <= n - 1; i++) {
for (int j = n - 1; j >= 1; j--) {
if (arr[j] < arr[j - 1]) {
temp = arr[j];
arr[j] = arr[j - 1];
arr[j - 1] = temp;
}
}
}
System.out.println();
System.out.println("升序排序后:");
for (int i = 0; i < n; i++) {
System.out.print(" " + arr[i]);
}