选择排序和冒泡排序

package practise;


import java.util.Arrays;


public class practise2 {
public static void main(String[] args) {
int[] a={5,8,3,4,1,6};
xuanzesort(a);
System.out.println(Arrays.toString(a));
}
public static void maopaosort(int[] a){
for(int i=0;i for(int j=0;j if(a[j]>a[j+1]){
int index=a[j+1];
a[j+1]=a[j];
a[j]=index;
}
}
}
}

public static void xuanzesort(int[] a){
for(int m=0;m for(int n=m+1;n if(a[m]>a[n]){
int last=a[n];
a[n]=a[m];
a[m]=last;
}
}
}
}
}