插入排序、冒泡排序

插入排序：

public static void main(String[] args) {
int[]ary={2,4,1,6,3,6,7,3,2,9,8};
sort(ary);
System.out.println(Arrays.toString(ary));
}
public static void sort(int[]ary){
int i,j,k;
for(i=1;i<ary.length;i++){
k=ary[i];
for(j=i-1;j>=0 && ary[j]>k;j--){
ary[j+1]=ary[j];
}
ary[j+1]=k;
}
}

**************************************************
冒泡排序
public static void main(String[] args) {
int[]ary={4,13,4,6,67,88,4,35,4,6,8};
sort(ary);
System.out.println(Arrays.toString(ary));
}
public static void sort(int[]ary){
for(int i=0;i<ary.length-1;i++){
for(int j=0;j<ary.length-i-1;j++){
if(ary[j]>ary[j+1]){
int t=ary[j];
ary[j]=ary[j+1];
ary[j+1]=t;
}
}
}