冒泡排序

public class MaoPao {
public static void main(String []args){
int []s={1,4,2,5,3,6,7};
int temp;
for(int i=0;i<s.length-1;i++){
for(int j=0;j<s.length-1-i;j++){
if(s[j]>s[j+1]){
temp=s[j];
s[j]=s[j+1];
s[j+1]=temp;
}
}
}
//Arrays.sort(s);
for(int x:s){
System.out.print(x+"\t");
}
}
}