冒泡排序:
import java.net.NetworkInterface;
public class Array05 {
//冒泡排序
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] a = new int[]{3,43,25,16,31,57,8};
for(int i=0;i<a.length;i++){
for(int j=i+1;j<a.length;j++){
if(a[i]>a[j]){
int k=a[i];
a[i]=a[j];
a[j]=k;
}
}
System.out.println(a[i]);
}
}
}