选择排序

package niu.cheng2;
//选择排序
public class StringBuffer2 {
public static void main(String[] args) {
int[] xx={7,6,5,4,3,2,1};
System.out.println("排序之前：");
Fe(xx);
System.out.println("---------------");
int x=0;
/*
for(int y=1;y<xx.length;y++){
if(xx[x]>xx[y]){
int a=xx[x];
xx[x]=xx[y];
xx[y]=a;
}
}
System.out.println("第一次之后为：");
Fe(xx);
System.out.println("---------------");

x=0+1;
for(int y=1+1;y<xx.length;y++){
if(xx[x]>xx[y]){
int a=xx[x];
xx[x]=xx[y];
xx[y]=a;
}
}
System.out.println("第二次之后为：");
Fe(xx);
System.out.println("---------------");

x=0+2;
for(int y=1+2;y<xx.length;y++){
if(xx[x]>xx[y]){
int a=xx[x];
xx[x]=xx[y];
xx[y]=a;
}
}
System.out.println("第三次之后为：");
Fe(xx);
System.out.println("---------------");

x=0+3;
for(int y=1+3;y<xx.length;y++){
if(xx[x]>xx[y]){
int a=xx[x];
xx[x]=xx[y];
xx[y]=a;
}
}
System.out.println("第四次之后为：");
Fe(xx);
System.out.println("---------------");

x=0+4;
for(int y=1+4;y<xx.length;y++){
if(xx[x]>xx[y]){
int a=xx[x];
xx[x]=xx[y];
xx[y]=a;
}
}
System.out.println("第五次之后为：");
Fe(xx);
System.out.println("---------------");

x=0+5;
for(int y=1+5;y<xx.length;y++){
if(xx[x]>xx[y]){
int a=xx[x];
xx[x]=xx[y];
xx[y]=a;
}
}
System.out.println("第六次之后为：");
Fe(xx);
System.out.println("---------------");
//代码重复度太高，用循环改进。
*/

for(int n=0;n<xx.length;n++){
x=0+n;
for(int y=1+n;y<xx.length;y++){
if(xx[x]>xx[y]){
int a=xx[x];
xx[x]=xx[y];
xx[y]=a;
}
}
}
System.out.println("排序之后的结果为：");
Fe(xx);



}
public static void Fe(int[] xx){
System.out.print("[");
for(int y=0;y<xx.length;y++){
if(y==xx.length-1){
System.out.print(xx[y]);
break;
}else{
System.out.print(xx[y]+",");
}
}
System.out.println("]");
}
}