资源列表
kmphebf
- ＢＦ和ＫＭＰ算法实例，曾经的作业，希望对你有点帮助-BF and KMP algorithm example, once the operation, and I hope to you a little help
topu
- 输入有向图的顶点，又有优先级的要求，通过此程序可以得到一个合理的排序-importation plan to the apex, another priority of the request, through this procedure can be a reasonable sort of
Poly---6yunsuan
- 可以实现两多项式的加减乘除及微积分运算，但因当时时间关系，没有对多项式进行有效性进行检查-can achieve the two polynomial arithmetic operations and calculus, but for the time, no right polynomial validity checks
2-sou-suo
- 分别用快速排序和分治算法对随机产生的200个数进行排序-respectively quicksort algorithm and the partition of the 200 randomly generated number Sort
lineartriangleassemble
- 此程序完成有限元计算中的总体合成功能,可用于任何使用有限元的情况-FEM calculation of the overall combined functions can be used for any use of the Finite Element
060624
- 图遍历的演示 设图的结点不超过30个，每个结点用一个编号表示（如果一个图有n个结点，则它们的编号分别为1,2,…,n）。通过输入图的全部边输入一个图，每个边为一个数对，可以对边的输入顺序作出某种限制-traverse the map-based presentation of the plan node is not more than 30, each node with a No. said (if a plan with n nodes, they were the No.
060625
- 用C实现的二叉树的建立与遍历希望大家喜欢-C achieved with the establishment of a binary tree traversal hope you like
060626
- 哈希表设计 针对某个集体中人名设计一个哈希表，使得平均查找长度不超过R，并完成相应的建表和查表程序。-Hash Table design is a design collective Names Hash Table 1, bringing the average length not exceeding find R, and completion of the corresponding construction and Lookup Table procedures.
060628
- 一个用C实现的堆排序问题算法,希望和大家交流-achieve a C sculptors scheduling algorithm, and you exchange
MagicSquare-huishu
- 当年，学turbo c的时候，书上有一个魔方算法；十年后，一个偶然的应用，我编写了这个回溯法的魔方算法。优点：可以计算n阶魔方的所有可能组合。-year, the school turbo c, the book is a Rubik's cube algorithm; Ten years later, an accidental use, I prepared this retroactive law Cube algorithm. Advantages : can calculate
Data_Structures_and_Software_Development_in_an_Obj
- 国外的数据结构与算法分析用书，用java语言编写，实现一个简单的类似于JDK中的类库，深入浅出。这是类库的源码-foreign data structure and algorithm analysis, using java language, to achieve a simple JDK similar to the library visitors. This is the source class library
P02006052285683812923
- 真是不好意思,现在实在没有程序,又急需下载.非常抱歉.-really sorry, no procedures, it will need to download. Very sorry.