算法设计与分析　插入排序

import java.util.Arrays;

public class InsertionSort {
 public static void insertionSort(int[] data) {
  for (int i = 1; i < data.length; i++) {
   int var = data[i];
   int j = i - 1;
   for ( ; j >= 0; j--) {
    if (data[j] > var) {
     data[j + 1] = data[j];
    } else {
     break;
    }
   }
   data[j + 1] = var;
  }
 }
 public static void main(String[] args) {
  int[] a = {3, 4, 1, 5, 9, 3, 2, 8, 10};
  insertionSort(a);
  System.out.println(Arrays.toString(a));
 }
}