插入排序 -- 算法小结

import java.util.*;

public class InsertionSort {
public int[] insertionSort(int[] A, int n) {
// write code here
int tem =0;
for(int i=1;i<n;i++){
tem = A[i];
for(int j=i-1;j>=0;j--){
if(A[j]>tem){
A[j+1]=A[j];
A[j]=tem;
}else{
break;
}
}
}
return A;
}
}