偶尔空闲,看看数据结构,来个冒泡排序
public static void main(String[] args) {
int []n = {3,2,1,89,12,34,90,56,22,43,100,78};
for (int out = n.length-1; out >0; out--) {
for (int in = 0; in < out; in++) {
if(n[in]>n[in+1]){
int temp = n[in];
n[in]=n[in+1];
n[in+1]=temp;
}
}
}
System.out.println("排序后:");
for (int i : n ) {
System.out.print(i+",");
}
}