资源列表
C++
- C++经典数值算法源码~~~~ C++经典数值算法源码~~~~ C++经典数值算法源码-C++ Classical numerical algorithm source ~ ~ ~ ~ C++ Classical numerical algorithm source ~ ~ ~ ~ C++ Classical numerical algorithm source code
tcsearch
- 本软件一共收录了355个TC2.0库函数，每一个函数都提供了相应的头文件，函数用途，函数全称，输入输出参数，函数的返回值，以及函数是如果应用的例子。提供了按功能分类，字母分类，直接输入，下拉列表等快速查询。是学习C语言，C＋＋语言的好助手。希望能给C，C＋＋编程爱好者一点帮助，学习好C语言。 -The software includes a total of 355 TC2.0 library functions, each function has been providing the
linennet_tt
- 使用自适应线性神经网络进行预测的实例 很有代表性-The use of adaptive linear neural network to predict very representative example of
BP
- 应用BP神经网络对两个函数进行非线性逼近，并给出MATLAB源程序，还对结果进行了分析。-Application of BP neural network of the two non-linear function approximation, and gives MATLAB source code, but also on the results are analyzed.
EWB
- 本文是EWB设计的方案描述，详细描述了设计的过程并富有相关的电路图，电路比较复杂，是高手学习的好材料！-This article is designed EWB program descr iption, a detailed descr iption of the design process and the rich associated circuitry, the circuit more complicated, is a master of good material to lear
number_of_subsequence
- 计算一个数列的最长递增子序列和最长递减子序列的长度-Calculation of a series of the longest increasing sub-sequence and the longest decreasing sequence of length
number_of_fibs
- 计算满足a<=x<=b且是Fibonacci数的x个数。-Calculated to satisfy a
prime_judge
- 米勒拉宾算法判断大质数，对质数的判断为必要条件，而非充分条件-Algorithm to determine米勒拉宾large prime number, confront a number of necessary conditions for the judge, not a sufficient condition for
123
- 数据结构课程中，采用非递归算法 ，利用栈中序遍历二叉树。-Data structure course, the use of non-recursive algorithm using binary tree traversal stack.
path_choose
- 任意给出两城市，找出两城市间的最短路径。还可以限定载重量，在满足载重量要求条件下，找出最短路径-Arbitrary given the two cities, two cities to find the shortest path. Can also limit the load to meet load requirements, find the shortest path
Wiener_T
- 一个简单的维纳滤波器的例子，适合初学者学习，很简单-A simple example of the Wiener filter, suitable for beginners to learn, very simple
dynamic_co-operation_cordic_fpga
- 一篇关于使用cordic实现动态配置以提高FPGA的整体性能的高效算法具体详解，很实用哦-On the use of CORDIC realization of a dynamic configuration to improve the overall performance of FPGA-specific high-performance algorithms explain, it is practical Oh