package sort_algorithm;
/**
* 插入排序
*/
public class InsertSort {
public static void insertSort(int[] insertSource) {
int temp, j;
for (int i = 1; i < insertSource.length; i++) {
temp = insertSource[i];
j = i - 1;
while (j >= 0 && temp < insertSource[j]) {
insertSource[j+1]=insertSource[j];
--j;
}
insertSource[j+1]=temp;
}
}
public static void main(String[] args) {
int[] a={2,1,3,4};
InsertSort.insertSort(a);
for (int aa:a){
System.out.println(aa);
}
}
}