一:选择法排序
public class XuanZe{
public static void main(String[] args){
int[] a=new int []{7,11,13,5,3,18};
System.out.println("排序之前");
for(int i=0;i<a.length;i++){
System.out.print(a[i]+"\t");
}
System.out.println();
//外层次数
for(int i=0;i<a.length-1;i++){
//每遍比较次数
for(int j=i+1;j<a.length;j++){
if(a[i]<a[j]){
int t=a[i];
a[i]=a[j];
a[j]=t;
}
}
}
System.out.println("排序之后");
for (int i=0;i<a.lenth;i++){
System.out.print(a[i]+"\t")
}
System.out.println();
}
}
二:冒泡排序
public class XuanZe{
public static void main(String[] args){
int[] a=new int []{7,11,13,5,3,18};
System.out.println("排序之前");
for(int i=0;i<a.length;i++){
System.out.print(a[i]+"\t");
}
System.out.println();
for(int i=0;i<a.length-1;i++)
if(a[i]>a[i+1]){
int t=a[i];
a[i]=a[i+1];
a[i+1]=t;
}
}
System.out.println("排序之后");
for (int i=0;i<a.lenth;i++){
System.out.print(a[i]+"\t")
}
System.out.println();
}
}
三:
public class XuanZe{
public static void main(String[] args){
int[] a=new int []{7,11,13,5,3,18};
System.out.println("排序之前");
for(int i=0;i<a.length;i++){
System.out.print(a[i]+"\t");
}
System.out.println();
Arrays.sort(a);
System.out.println("排序之后");
for (int i=a.lenth-1;i>=0;i--){
System.out.print(a[i]+"\t")
}
System.out.println();
}
}