算法设计的实验报告

包括Bottom-Up Merge Sorting算法、插入排序算法Heaps的创建堆、堆排序算法、按秩合并算法以及带路径压缩算法、实现查找第K小元素算法、实现快速排序算法、实现平面内最接近点对算法、实现最长公共子序列算法、实现矩阵链相乘算法、实现0/1背包问题算法、实现Dijistra’s算法、Prim算法、Kruskal算法、文件压缩算法-Experimental Algorithm Design Report including Bottom-Up Merge Sorting Algorithm, Insertion Sort algorithm creation Heaps Heap, Heap Sort algorithm, according to rank and merge algorithm with path compression algorithm to find the first small element K algorithm, the realization of quick sort algorithm, the realization of planar within the nearest point on the algorithm to achieve the longest common sub-sequence algorithm, the realization of matrix-chain multiplication algorithm, the realization of 0/1 knapsack problem algorithm Dijistra s algorithm, Prim algorithm, Kruskal algorithm, file compression algorithm