java中的冒泡排序与选择排序

import java.util.Arrays;

//冒泡排序
class Demo8 {
public static void main(String[] args) {
int[] age = { 1, 55, 2, 36, 363, 56 };
for (int i = 0; i < age.length; i++) {
for (int j = 0; j < age.length - 1 - i; j++) {
if (age[j] < age[j + 1]) {
int t = 0;
t = age[j];
age[j] = age[j + 1];
age[j + 1] = t;
}
}
}
System.out.println(Arrays.toString(age));
}
}
//选择排序
public class Demo4 {
public static void main(String[] args) {
int[] f = { 5, 8, 45, 3, 0, 37 };
for (int i = 0; i < f.length; i++) {
for (int j = i + 1; j < f.length; j++) {
if (f[i] > f[j]) {
int t = 0;
t = f[i];
f[i] = f[j];
f[j] = t;
}
}
}
System.out.println(Arrays.toString(f));
}
}