算法复习之插入排序

public class InsertionSorting  {
public static void sort(int[]src){
for (int i = 1; i < src.length; i++) {
for(int j=i;j>0;j--){
if(src[j]<src[j-1]){
exchange(src,j,j-1);
}
}
}
}
public static void exchange(int[]src,int i,int j){
int temp = src[i];
src[i]=src[j];
src[j]= temp;
}
public static void main(String[] args) {
int[] src = new int[]{5,2,8,3,5,0};
sort(src);
for (int i : src) {
System.out.println(i);
}
}
}