资源列表
bag
- 有关背包方面的问题，包括普通背包，复杂背包，多重背包，背包的泛化物品-For knapsack problems, including ordinary backpack, backpack complex, multi-pack, backpack generalization items
Dynamic-Program
- 动态规划的问题，有基础类的背包问题，邮局问题等，里面也有该类问题的源码-Dynamic programming problem, the knapsack problem with class-based, post offices and so on, which is also the source of such problems
suanfayishuyuxinxixuejingsai
- 算法艺术与信息学竞赛题目完全解析，该文档为pdf格式，方面学习和使用-Algorithm is the subject of art and information science contest completely resolved, the document to pdf format, in learning and using
zuheshuxue
- 美国的组合数学书籍，翻译版，里面详细的介绍了有关组合数学的一系列问题-Combination of U.S. mathematics books, translations, which describes in detail a range of issues related combinatorics
Shortest-path
- 因特网最短路径优先(OSPF)路由算法的实现：根据给定的网络拓扑图求某路由器到其它路由器的最短路径，并生成路由表-Internet Shortest Path First (OSPF) routing algorithm to achieve: given the network topology of a router to other routers find the shortest path, and generate routing tables
algo
- 搜索 排序 简洁高效的调用代码 供使用者方便使用-Search Sort
Josephus
- 设计一个可变长顺序表，当用户所给的数据超出定义所分配的空间时，可以动态的扩展数组空间-Order to design a variable-length table, when the data exceeds the user to define the allocated space, you can dynamically expand the array space
hang-luo-ta
- 汗罗塔的算法，有递归和非递归的算法分析，程序可以自己看看！-Khan Rota' s algorithm, recursive and non recursive algorithm analysis, the program can see for yourself!
SortDemo
- 实现排序操作\SortDemo\SortDemo.rar,很不错的vc源码，希望对大家有所帮助。-To achieve the sorting operation \ SortDemo \ SortDemo.rar, very good vc source, we want to help.
SearchReplaceStr
- 实现查找、替换字符串\SearchReplaceStr\SearchReplaceStr.rar,很不错的vc源码，希望对大家有所帮助。-Achieve search, replace string \ SearchReplaceStr \ SearchReplaceStr.rar, very good vc source, we want to help.
PtrList
- 使用CPtrList类创建和使用链表\PtrList\PtrList.rar,很不错的vc源码，希望对大家有所帮助。-Use CPtrList class to create and use lists \ PtrList \ PtrList.rar, very good vc source, we want to help.
7_5_1
- 编写程序，输入两个字符串分别存入两个一维字符数组，将其连接后存入第三个一维字符数组后输出，要求用指向一维数组的指针变量来处理其中的字符，不能使用字符串处理函数-Programming, enter the two strings are stored in two one-dimensional array of characters, its connection into the third after a one-dimensional array of characters output