资源列表
binarytree
- 重构二叉树的一个算法，如何用二叉树解决问题-Reconstruction of a binary tree algorithm, how to solve the problem tree
cynjj
- 给定如下元素的数组，根据最大堆的结构，说明对这些数组按递增顺序进行堆排序的步骤，并确定它们所执行的元素比较次数。-Given the following array of elements, based on the maximum heap structure indicates that these arrays are sorted in ascending order of the steps heap sort and identify the elements of the impl
mulVNewton
- 牛顿法解非线性方程，绝对有效，供大家共同使用。-Newton' s method for solving nonlinear equations, absolute and effective for common use.
dayintuxing
- 这个题目主要通过调用函数和数组来解决，通过两个调用函数来解决问题-The main subject and the array by calling the function to solve, by calling the function to solve the problem of two
mohulogic
- 自己做的一个关于模糊逻辑的控制器，输入隶属函数为高斯型，输出为三角型-a fuzzy logic controller
ss
- 次文件主要是一个 可以实现自我删除的c语言原代码，但必须在vc中运行-Second document was an self delete c language source code, but must run in the vc
1080
- N皇后（ 深度优先搜索 ） n=6-12-N Queens (depth first search) n = 6-12
backbag
- 使用回溯算法解决问题，用C++语言实现。-Backtracking algorithm to solve the problem, using C++ language.
zuixiaogongpeishuhezuidagonguueshu
- 关于用C语言实现求两个数的最大公约数和最小公倍数-Maximum and minimum when LCD
dampnm
- 阻尼牛顿法求解无约束优化问题，阻尼牛顿发求解无约束优化问题-Damped Newton method for solving unconstrained optimization problems
JosephRing
- 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围，每个人有一个密码。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到上一个人的密码的数的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。-Known n individuals (in numbers 1,2,3 ... n, respectively) sitting around a round table around, everyone has a password. From the
burg
- 根据最小化正向和反向两个预测误差的和来决定预测滤波器的参数。-According to minimize the forward and reverse two prediction error and to determine the parameters of the predictive filter.