我的生活，一个不错的日记本，相信你回喜欢的！

一个很叨 的算法作业,很强大的源代码 很强大的源代码很强大的源代码-A very garrulous operation of the algorithm, it is a powerful source code is a powerful source code is a powerful source code

数据结构大型作业实验报告-哈夫漫-data structure large operations Experimental Report-Halff Man

背包回溯法,初来乍到如有其他问题还请各位多多指教.-knapsack backtracking, just arrived at that if other issues also invited to the exhibitions.

节点类，提供了全套节点相关处理函数-category nodes, providing a complete set of nodes Functions

SR-tree is an index structure for high-dimensional nearest neighbor queries，C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image / video applications.-SR-tree is an index structure for high-dimensional nearest neighbor queries,C++ sourcecode. SR-tree outperforms the R*-tree and the SS-tree especially for high-dimensional and non-uniform data which are likely to appear in the actual image/video applications.

仓库源码。自己制作的。希望大家可以来信息指教-Warehouse source. Their own. I hope everyone can come to information index

在知道点的坐标或者数量和权重值时，选择最优的路径，这种有的是基于时间有的是基于运费等等，自动找两点路径最短距离！-Know the coordinates of points in the volume and weight or value, the choice of the optimal path, this time based on some because of some freight, etc., automatically find the shortest distance between two points in the path!

1.1 算法与程序 1.2 算法与数据结构 1.3 表达算法的抽象机制 1.4 描述算法与算法设计 1.5 算法分析的基本原则 1.6 算法复杂性分析

设计一个哈夫曼编码、译码系统。对一个ASCII编码的文本文件中的字符进行哈夫曼编码，生成编码文件；反过来，可将编码文件译码还原为一个文本文件。1.初始化。任意读入一个ASCII编码的文件，统计数据，建立哈夫曼树。2.编码。利用已建立的哈夫曼树给出每个字符的哈夫曼编码。3.图形化输出哈夫曼树中各结点以及哈夫曼编码。4.译码。利用已建立的哈夫曼树对输入文件进行译码并存储为.huf压缩文件。5.反译码。将huf文件译码为ASCII编码的txt文件，与原txt文件进行比较。

数据结构的一个试验，是一个多项式的运算，里面封装了，链表的操作，堆栈的操作等常用的数据结构，适合初学者-data structure of a test is a polynomial arithmetic inside a package, Chain operation, the operation of stack common data structure, suitable for beginners