资源列表
jiefangcheng
- 可以用二分法来解非线性方程解方程，简单的程序代码，虽简单，但很实用-Dichotomy can be used for solving nonlinear equations equation, a simple code, though simple, but very practical
Huffman(1)
- 栈类的实现，包括入栈，出栈，取栈顶地址，并且实现其测试-Stack class implementation, including stack, a stack, get stack address, and to achieve its testing
comp
- this file is useful for computational complexity
algorithm_report
- 算法设计报告5个重要算法，包括贪心，回溯，动态规划，分支限界，分治法，每种算法介绍及实例问题代码，C++成功编译运行-Algorithem report including 5 Major algorithms
search
- 该源码用于实现广度搜索，大家可以相互学习，欢迎提供意见-The source code used to achieve the breadth of search, we can learn from each other, welcome advice
jingdiansuanf
- 二叉树的递归与非递归遍历(Java描述)，高效实现Josephus算法，合并有序链表，基于队列实现的基数排序，栈.回溯.迷宫问题求解。5个算法的源程序。-Recursive and non recursive binary tree traversal (Java descr iption), efficient algorithms to achieve Josephus, merging sorted linked list, queue-based implementation of ra
PCA
- PCA仿真程序,用于主成分析法,可在工程,经济上使用.-PCA
crc
- simple crc in assembly
crack_kit
- Boundary element code for fracture mechanics
coshell
- fortran program for axisymmetric shells
Number_of_Solutions_E2v2
- Paper that enumerates the posibilities to find a solution to the Eternity 2 Game, plus a MIT research result showing number of solutions.
shuanfa1
- 实现背包问题的三种贪心策略，背包问题描述如下: 已知 背包容量M=120 物品种类数n=10 各种物品的总效益pi(i=1,2,………10) : 50,60,70,80,90,80,70,60,50,40 各种物品的总重量wi(i=1,2………10) : 17,30,25,41,80,70,64,56,47,38 求: 各种物品所取重量占其总重量的比例xi(i=1,2,…..10),满足0<=xi<=1, 且 且使得 达到最大值. -