哈工程——算法实验代码&报告（最新版）

[{"title":"（ 65 个子文件 1.47MB ） 哈工程——算法实验代码&报告（最新版）","children":[{"title":"2014061523王延康","children":[{"title":"java","children":[{"title":"ALGO_LAB_2014061523","children":[{"title":"bin","children":[{"title":"algo_lab_code","children":[{"title":"MaxHeap.class <span style='color:#111;'> 3.19KB </span>","children":null,"spread":false},{"title":"KnapsackBacktracking.class <span style='color:#111;'> 1.13KB </span>","children":null,"spread":false},{"title":"TheClosestPoint$Point.class <span style='color:#111;'> 492B </span>","children":null,"spread":false},{"title":"Knapsack$Element.class <span style='color:#111;'> 941B </span>","children":null,"spread":false},{"title":"TheClosestPoint.class <span style='color:#111;'> 5.32KB </span>","children":null,"spread":false},{"title":"Knapsack.class <span style='color:#111;'> 3.23KB </span>","children":null,"spread":false},{"title":"task.class <span style='color:#111;'> 449B </span>","children":null,"spread":false},{"title":"TheLongestCommonSubsequence.class <span style='color:#111;'> 1.74KB </span>","children":null,"spread":false},{"title":"Element.class <span style='color:#111;'> 738B </span>","children":null,"spread":false},{"title":"TheClosestPoint$Point2.class <span style='color:#111;'> 745B </span>","children":null,"spread":false},{"title":"BinarySearch.class <span style='color:#111;'> 1.03KB </span>","children":null,"spread":false},{"title":"HeapNode.class <span style='color:#111;'> 845B </span>","children":null,"spread":false},{"title":"BBKnapsack.class <span style='color:#111;'> 3.59KB </span>","children":null,"spread":false},{"title":"ActivityArrangementProblem.class <span style='color:#111;'> 1.88KB </span>","children":null,"spread":false},{"title":"HuffmanEncoding.class <span style='color:#111;'> 298B </span>","children":null,"spread":false},{"title":"KnapsackBranchBoundMethod.class <span style='color:#111;'> 1.79KB </span>","children":null,"spread":false},{"title":"LinearTimeToChoose.class <span style='color:#111;'> 1.90KB </span>","children":null,"spread":false},{"title":"MergeSort.class <span style='color:#111;'> 1.75KB </span>","children":null,"spread":false},{"title":"TheOptimalTriangulation.class <span style='color:#111;'> 322B </span>","children":null,"spread":false},{"title":"BBnode.class <span style='color:#111;'> 433B </span>","children":null,"spread":false},{"title":"Random.class <span style='color:#111;'> 965B </span>","children":null,"spread":false},{"title":"TheClosestPoint$Point1.class <span style='color:#111;'> 681B </span>","children":null,"spread":false},{"title":"TheClosestPoint$Pair.class <span style='color:#111;'> 713B </span>","children":null,"spread":false},{"title":"KnapsackDynamicProgramming.class <span style='color:#111;'> 2.45KB </span>","children":null,"spread":false},{"title":"QuickSort.class <span style='color:#111;'> 1.68KB </span>","children":null,"spread":false},{"title":"MatrixMultipleMultiplication.class <span style='color:#111;'> 1.65KB </span>","children":null,"spread":false}],"spread":false}],"spread":true},{"title":".settings","children":[{"title":"org.eclipse.core.resources.prefs <span style='color:#111;'> 97B </span>","children":null,"spread":false},{"title":"org.eclipse.jdt.core.prefs <span style='color:#111;'> 603B </span>","children":null,"spread":false}],"spread":true},{"title":"src","children":[{"title":"algo_lab_code","children":[{"title":"KnapsackDynamicProgramming.java <span style='color:#111;'> 1.94KB </span>","children":null,"spread":false},{"title":"TheLongestCommonSubsequence.java <span style='color:#111;'> 1.28KB </span>","children":null,"spread":false},{"title":"BinarySearch.java <span style='color:#111;'> 545B </span>","children":null,"spread":false},{"title":"TheClosestPoint.java <span style='color:#111;'> 5.12KB </span>","children":null,"spread":false},{"title":"MergeSort.java <span style='color:#111;'> 1.21KB </span>","children":null,"spread":false},{"title":"QuickSort.java <span style='color:#111;'> 1.31KB </span>","children":null,"spread":false},{"title":"HuffmanEncoding.java <span style='color:#111;'> 63B </span>","children":null,"spread":false},{"title":"LinearTimeToChoose.java <span style='color:#111;'> 2.44KB </span>","children":null,"spread":false},{"title":"KnapsackBacktracking.java <span style='color:#111;'> 3.86KB </span>","children":null,"spread":false},{"title":"ActivityArrangementProblem.java <span style='color:#111;'> 1.76KB </span>","children":null,"spread":false},{"title":"TheOptimalTriangulation.java <span style='color:#111;'> 71B </span>","children":null,"spread":false},{"title":"MatrixMultipleMultiplication.java <span style='color:#111;'> 974B </span>","children":null,"spread":false},{"title":"KnapsackBranchBoundMethod.java <span style='color:#111;'> 9.65KB </span>","children":null,"spread":false}],"spread":false}],"spread":true},{"title":".project <span style='color:#111;'> 395B </span>","children":null,"spread":false},{"title":".classpath <span style='color:#111;'> 303B </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"实验报告","children":[{"title":"08.凸多边形最优三角划分.docx <span style='color:#111;'> 104.65KB </span>","children":null,"spread":false},{"title":"10.活动安排问题.docx <span style='color:#111;'> 95.25KB </span>","children":null,"spread":false},{"title":"01.二分搜索.docx <span style='color:#111;'> 91.45KB </span>","children":null,"spread":false},{"title":"07.最长公共子序列.docx <span style='color:#111;'> 116.44KB </span>","children":null,"spread":false},{"title":"06.矩阵连乘问题.docx <span style='color:#111;'> 101.99KB </span>","children":null,"spread":false},{"title":"13.0-1背包分支界限法.docx <span style='color:#111;'> 95.19KB </span>","children":null,"spread":false},{"title":"12.0-1背包回溯法.docx <span style='color:#111;'> 97.16KB </span>","children":null,"spread":false},{"title":"02.合并排序.docx <span style='color:#111;'> 91.91KB </span>","children":null,"spread":false},{"title":"09.0-1背包动态规划法.docx <span style='color:#111;'> 87.65KB </span>","children":null,"spread":false},{"title":"05.最接近点对问题.docx <span style='color:#111;'> 102.94KB </span>","children":null,"spread":false},{"title":"03.快速排序.docx <span style='color:#111;'> 96.43KB </span>","children":null,"spread":false},{"title":"11.哈夫曼编码.docx <span style='color:#111;'> 39.61KB </span>","children":null,"spread":false},{"title":"04.线性时间选择.docx <span style='color:#111;'> 119.66KB </span>","children":null,"spread":false}],"spread":false},{"title":"C++","children":[{"title":"凸多边形最优三角剖分","children":[{"title":"TheOptimalTriangulation.o <span style='color:#111;'> 3.12KB </span>","children":null,"spread":false},{"title":"TheOptimalTriangulation.cpp <span style='color:#111;'> 1.80KB </span>","children":null,"spread":false},{"title":"TheOptimalTriangulation.exe <span style='color:#111;'> 1.00MB </span>","children":null,"spread":false}],"spread":true},{"title":"哈夫曼编码","children":[{"title":"HuffmanEncoding.c <span style='color:#111;'> 2.42KB </span>","children":null,"spread":false},{"title":"base1.h <span style='color:#111;'> 661B </span>","children":null,"spread":false},{"title":"base2.h <span style='color:#111;'> 251B </span>","children":null,"spread":false},{"title":"HuffmanEncoding.o <span style='color:#111;'> 1.98KB </span>","children":null,"spread":false},{"title":"HuffmanEncoding.exe <span style='color:#111;'> 29.03KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"ReadMe.txt <span style='color:#111;'> 1.84KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}]