插入排序

 1 public static void main(String[] args){
 2         int a[] = {34, 8, 64, 51, 32, 21};
 3         insertionSort(a);
 4         for (int i = 0; i < a.length; i++) {
 5             System.out.print(a[i] + " ");
 6         }
 7     }
 8     
 9     public static void insertionSort(int[] a) {
10         for (int i = 1; i < a.length; i++) {
11             int insertNode = a[i];
12             int j = i-1;
13             while (j >= 0 && insertNode < a[j]) {
14                 a[j+1] = a[j];
15                 j--;
16             }
17             a[j+1] = insertNode;
18         }
19     }