数据结构-插入排序法

/**
 * 插入排序法
 *
 */
public class InsertSort {

    public static void main(String[] args) {
        int data[] = new int[] {6, 4, 9, 8, 3};
        System.out.print("原始数据：");
        showData(data);
        insert(data);
        System.out.print("排序后的数据：");
        showData(data);
    }
    
    private static void insert(int data[]) {
        int i, j, tmp;
        for (i = 1; i < data.length; i++) {
            tmp = data[i];
            j = i;
            while (--j >= 0 && tmp < data[j]) {
                data[j+1] = data[j];
                data[j] = tmp;
            }
            showData(data);
        }
    }
    
    private static void showData(int data[]) {
        for (int i = 0; i < data.length; i++) {
            System.out.printf("[%d]", data[i]);
        }
        System.out.printf("%n");
    }

}