数字排序(冒泡排序,选择排序)

public class E {
/**
* @param args
*            数字排序
*/
public static void main(String[] args) {
// 选择排序
int[] a = { 5, 6, 7, 1, 2, 4, 9, 3 };
int b;
for (int i = 0; i < a.length - 1; i++) {
for (int j = i + 1; j < a.length; j++) {
if (a[i] < a[j]) {
b = a[j];
a[j] = a[i];
a[i] = b;
}
}
}
// System.err.println(Array.toString());
for (int i : a) {
System.err.print(i + "  ");
}


// 冒泡排序
int[] c = { 5, 6, 7, 1, 10, 2, 4, 9, 3 };
for (int i = 0; i < c.length - 1; i++) {
for (int j = 0; j < c.length - 1 - i; j++) {
if (c[j] > c[j + 1]) {
b = c[j + 1];
c[j + 1] = c[j];
c[j] = b;
}
}
}
// System.err.println(Array.toString());
System.out.println();
for (int i : c) {
System.err.print(i + "  ");
}
}
}