数据结构之插入排序

ArrayInsertSort.java 代码

public class ArrayInsertSort {

    public static void main(String[] args) {
        int[] arrayBub = { 43, 36, 11, 10, 29, 58, 15, 9 };

        insertSort(arrayBub);
        System.out.print("after insert sort:");
        disp(arrayBub);
    }

    private static void insertSort(int[] arraySort) {
        int in, out;
        for (out = 1; out < arraySort.length; out++) {
            int tmp = arraySort[out];
            in = out;
            while (in > 0 && tmp <= arraySort[in - 1]) {
                arraySort[in] = arraySort[in - 1];
                in--;
            }

            arraySort[in] = tmp;
            disp(arraySort);
        }
    }

    private static void disp(int[] arraySort) {
        for (int i = 0; i < arraySort.length; i++) {
            System.out.print(arraySort[i] + " ");
        }
        System.out.println("");
    }

}

分享到：

数据结构之归并排序 | 数据结构之选择排序

• 2007-09-10 16:28
• 浏览 961
• 评论(0)
• 查看更多