资源列表
先序建立树
- 数据结构中，先序建立二叉树算法，在建树的基础上可以进行树的其他操作，思想简单易懂-data structure, the first order to establish a binary tree algorithm, the contribution on the basis of the tree can be conducted in other operations, thinking simple and understandable
数值分析算法与说明文档
- 这是我数值分析课程的实习题目的源代码(并附有文档),文档包括对问题进行了描述,并对结果进行分析,希望对大家有所帮助.-numerical analysis courses internship topic source code (together with documentation), including documentation of the problem described, and results analysis, we hope to help.
用C语言实现最近最久未使用（LRU）置换算法
- c语言编的LRU置换算法，word文档格式-series of the LRU algorithm replacement, word document formats
LRU算法的自编c++实现及源码。
- 实现LRU算法的C++版，word环境下写的，c++环境下运行-LRU algorithm to achieve the C version, word environment written in the running environment c
FIFO与LRU 算法实现（java）
- java编的两种算法，word写的，看不懂，大家帮忙-java series of the two algorithms, write the word, fail to understand, we look at the help
实例116 多点曲线光滑拟和
- 基于离散多点的曲线拟合 把多个离散点拟合成曲线-based on discrete multiple points of curve fitting from multiple discrete points to the composite curve
Leasen图的建立和DFS&BFS算法
- 数据结构中关于DFS和BFS的练习，较简单的实现了二叉树的DFS和BFS搜索-data structure of DFS and BFS practice, the realization of a simple binary tree search DFS and the BFS
LRU页面置换算法模拟 CNBIE
- LRU页面置换算法模拟,LRU置换算法虽然是一种比较好的算法，但要求系统有较多的支持硬件。为了了解一个进程在内存中的各个页面各有多少时间未被进程访问，以及如何快速地知道哪一页是最近最久未使用的页面.-LRU algorithm simulation replacement pages, the LRU algorithm replacement is a better algorithm, but requires a system with more hardware support. In
inter
- 用VC实现的简单大数的划分,采用递归算法实现-with VC simple majority of the division, using recursive algorithm
GAfunction
- 请大家看一看, 我编的这个用遗传算法求 f(x)=xsin(10pi*x)+2.0 x为-1到2区间的值-Please look, I spent part of the genetic algorithm for f (x) = xsin (10pi * x) 2.0 x 2 -1 range of values
dos下的校园导游图
- 校园导游图，在dos环境实现，用了最短路径算法，可以查询两点的最短路径及长度-campus tour map, dos environment achieved, with the shortest path algorithm can find the shortest path two lengths and
背包问题的两种算法实现
- 本例编程实现背包问题的递归和非递归算法，让你彻底了解这种算法-the cases Programming knapsack problem of recursive and non - recursive algorithm, so you thoroughly understand this algorithm