资源列表
bitree3
- 使用汇编写的二叉树遍历，我用的是按层存储算法，容易理解-was compiled using the binary tree traversal, I used is based on the storage layer algorithm, easy to understand
遗传算法原理及应用
- 这是一本较详细介绍遗传算法原理和应用的书籍，很多应用在本书中多有介绍-This is a more detailed genetic algorithm theory and application of books, many applications in this book presents more
gaul-devel-0.1849-0.tar
- 关于遗传算法的一些见地。特别是关于简单遗传程序设计的实现。-on Genetic Algorithms some insight. Especially on the simple genetic procedures designed to achieve.
归并外排序
- 归并外排序,要先运行file程序，在硬盘上建立dat文件，再运行排序程序-ranking first run file procedures, the establishment of dat drives on paper, sorting operation procedures
bin_tree_demo
- 二叉平衡树算法，包括二叉平衡树的数据结构定义、创建、插入、查找、删除、释放内存等方法。-two forks balanced tree algorithms, including two forks balance tree data structure definition, create, insert, search, delete, release methods such as memory.
hash_map
- STL哈希表的使用范例：包括哈希表的创建、插入、查找、删除、内存分配和释放内存。-STL use examples include : Hash Table creation, insert, search, delete, memory allocation and release memory.
几何算法
- 一些常用的几何算法的C++实现,包括两点确定一条直线,两点间距离,点直线距离, 海伦公式求三角形面积,判断直线相交等-some common geometric algorithm C achieved, including two identified a straight line, the distance between two points, point straight distance Helen formula for triangle area, as judged strai
石子
- 动态规划的石子问题算法下载压缩包后，解压，使用vc-stones dynamic programming problem packet compression algorithm download, extract, use vc
083aSharpZipLib
- 实现文件压缩和解压缩，全英文有兴趣的同志请仔细阅读，相信你一定能得到一些启发-achieve compression and decompression, all are interested in the English comrades please read carefully, I think you will get some insights
用VB压缩文件
- 用VB实现文件压缩和解压缩，对于初学VB的同志具有参考价值-VB document compression and decompression, for beginners VB comrades reference value
进制转换(M)
- 一个简单实用的进制转换算法，该算法能实现二、八、十、十六进制的相互转化。-a simple and practical base for the conversion algorithm, the algorithm can achieve 2, 8, 10, hexadecimal the mutual conversion.
排序(M)
- 这是关于文件操作的一个题，由题意可知，该题解决起来应该分为三个部分。第一部分即从in.dat中读入数据，第二部分即实现排序的算法，最后应该实现将排序的结果输出到out.dat中。-This is the document on the operation of a title, and that Italy, we can see that the solutions to the problem should be divided into three parts. The first par