资源列表
main
- 哈弗曼树的优化实现， 哈弗曼树的优化实现，哈弗曼树的优化实现-Optimization of Havermann tree, Havermann tree optimized to achieve Havermann tree optimization to achieve Havermann tree optimization to achieve
DataMining
- 读入，更改EXCEL数据，做出计算！一些函数的调用实现！-read and write data from ms excel，caculate them and use some particular functions
Algorithms_for_Programmers
- 上传一部算法书，我个人觉得不错 写每个算法的具体实现，有些算法不止一个实现 嗯 真的很不错-Upload an algorithm the book, I personally feel that a good write each algorithm to achieve, some algorithm is more than an implementation ah really good
heap
- 实现栈的基本操作，建栈，进栈，出栈，数据结构实现-To achieve the basic operation of the stack, built stack into the stack, the stack data structure
ThePCPPPStandardPLibrary
- C++ 标准程序库 C++标准库的教学应用手册-C++ the standard library C++ standard library Teaching Application Notes
suanfafenxi
- 算法分析课程讲解，完整而且内容十分具有代表性，让学生真正可以学好算法-Algorithm analysis course explains the complete and very representative, so that students can really learn algorithm
the-structor-of-data
- 介绍了c语言的数据结构，有助于理解c语言的构成-C language data structure helps to understand the composition of the c language
jicha
- 给定n个正整数数列，进行如下操作：每次删去两个数 a和b，添加1个数 a*b+1,直到只剩1个数N。在所有的这样的N中，有1个最大Max的和最小的Min，M=Max-Min是极差。设计程序计算 M -Given n positive integers, proceed as follows: each time deleting two numbers a and b, add a number of a* b+1 until only a number of N. All this N,
beibao
- 给定一个容量为C的背包及n个重量为 wi，价值为pi的物品，要求把物品装入背 包，使背包的价值最大，此类问题为背 包问题。物品或者装入背包，或者不装 入背包，称之为0/1背包问题。 -A given a capacity for the the C of the backpack, and n a of by weight for the wi, the value of for the the the items of of pi, requirements of the
astar
- A*算法 1、将开始节点放入开放列表(开始节点的F和G值都视为0) 2、重复以下步骤: 在开放列表中查找具有最小F值的节点,并把查找到的节点作为当前节点 把当前节点从开放列表删除, 加入到封闭列表. -A* algorithm 1, will begin to node placed in the and opening up list of (the began to node of the F and G values are regarde
dstring
- 动态规划——编辑距离问题 设A和B是2个字符串。要用最少的字符操作将字符串A转换为字符串B。-Dynamic Programming- edit distance problem Let A and B are two strings. Characters use the least action string A converted to a string B.
BruteForceClosePoints
- 蛮力法解决最近对问题， 随机生成5个点，然后求出距离最近的一对-The brute force method to solve the problem, randomly generated five points, then find the distance of a pair of