04/15/2020发表Code

算法分析入门系列(三) 动态规划算法

作业排程问题

问题描述

Automobile factory with two assembly lines(汽车厂两条装配线)

– Each line has n stations: S1,1, . . . , S1,n and S2,1, . . . , S2,n(每条装

配线有n个工序站台)

– Corresponding stations S1, j and S2, j perform the same function

but can take different amounts of time a1, j and a2, j (每条装配线的

第j个站台的功能相同,但是效率不一致)

– Entry times e1 and e2 and exit times x1 and x2(上线和下线时间)

04/15/2020发表Code

算法分析入门系列(四) 最短路径算法

单源最短路径算法

问题描述

04/15/2020发表Code

算法分析入门系列(二) 分治算法

Strassen矩阵算法

矩阵分割

将

04/15/2020发表Code

算法分析入门系列(一) 排序算法

排序算法

`main`函数代码

public static void main(String[] args) {
    int max = 10;
    System.out.println("插入排序-------------------------------------");
    int[] num = randomCreate(max);
    printResult(num);
    Long bt = System.nanoTime();
    int[] temp1 = insertSort(num);
    Long et = System.nanoTime();
    System.out.println("排序用时：" + (et - bt + ""));
    printResult(temp1);


    System.out.println("合并排序-------------------------------------");
    int[] temp4 = randomCreate(max);
    printResult(temp4);
    Long bt2 = System.nanoTime();
    mergeSort(temp4);
    Long et2 = System.nanoTime();
    System.out.println("排序用时：" + (et2 - bt2 + ""));
    printResult(temp4);


    System.out.println("快速排序-------------------------------------");
    int[] temp5 = randomCreate(max);
    printResult(temp5);
    Long bt3 = System.nanoTime();
    quickSort(temp5, 0, temp5.length - 1, false);
    Long et3 = System.nanoTime();
    System.out.println("排序用时：" + (et3 - bt3 + ""));
    printResult(temp5);

    System.out.println("随机化快速排序--------------------------------");
    int[] temp9 = randomCreate(max);
    printResult(temp9);
    Long bt7 = System.nanoTime();
    quickSort(temp9, 0, temp9.length - 1, true);
    Long et7 = System.nanoTime();
    System.out.println("排序用时：" + (et2 - bt2 + ""));
    printResult(temp9);


    System.out.println("桶排序---------------------------------------");
    int[] temp6 = randomCreate(max);
    printResult(temp6);
    Long bt4 = System.nanoTime();
    temp6 = bucketSort(temp6, max);
    Long et4 = System.nanoTime();
    System.out.println("排序用时：" + (et4 - bt4 + ""));
    printResult(temp6);

    System.out.println("计数排序-------------------------------------");
    int[] temp7 = randomCreate(max);
    printResult(temp7);
    Long bt5 = System.nanoTime();
    temp7 = countSort(temp7);
    Long et5 = System.nanoTime();
    System.out.println("排序用时：" + (et5 - bt5 + ""));
    printResult(temp7);

    System.out.println("基数排序-------------------------------------");
    int[] temp8 = randomCreate(max);
    printResult(temp8);
    Long bt6 = System.nanoTime();
    radixSort(temp8, (max + "").length());
    Long et6 = System.nanoTime();
    System.out.println("排序用时：" + (et6 - bt6 + ""));
    printResult(temp8);
    System.out.println("---------------------------------------------");

}