搜索资源列表
cordic_sqrt_atan
- 利用cordic实现开方和atan运算的matlab源码。 本人原创，标准cordic算法。-calculate aquare root and atan by cordic. Matlab m language.
newton_iterate
- 利用顿迭代法来求域上任意f(x)的解.给定一个值与其精度范围,就能解出方程的近似解.-to find out the root of any f(x) by using the method of newton iterate.
Huffman
- 用vc++实现用最短路径查找哈弗曼树。n个权值构成n棵二叉树的集合F={T1, T2, …, Tn}，其中每棵二叉树Ti中只有一个带树为Ti的根结点。-Achieved with the vc++ to find the shortest path tree Havermann. n-weight constitutes a collection of n binary trees F = (T1, T2, ..., Tn), which is only a Ti binary Each spe
mulNewtonSOR
- 本代码为牛顿-SOR迭代法求解非线性方程组。其调用格式为[r,m]=mulNewtonSOR(F,x0,w,h,eps) 其中F:方程组，x0：方程组初始解，w：SOR迭代因子，h：数值积分常数，eps：根的精度，m：迭代步数。-The code for the Newton-SOR iteration method for solving nonlinear equations. Its call format [r, m] = mulNewtonSOR (F, x0, w, h, eps)
root
- 自己在做设计过程中设计的一个求解任意三角函数的函数，希望对大家有用-They are doing the design process designed to solve a trigonometric function of any hope for all of us
BiTree
- 输入一个字符串，并建成一棵二叉树，满足左子树的字符都要小于根结点的字符，右字树的字符都要大于根结点的字符，每个结点值有字符和字符的出现次数，并用三种遍历方法打印，比较是否与自己想象的相一致。再求树的深度、叶子结点数、最大结点值。 （补充：对二叉树实现所有左右子树的交换并中序输出结果） -Enter a string, and the completion of a binary tree, to meet the characters in the left subtree must b
tree
- 确定二叉树的特征。如：每个节点的层次，从根到该节点的枝长（路径长度），子孙的个数及祖先的个数。每个节点在前序、中序、后序中的访问的序号。-To determine the characteristics of a binary tree. Such as: the level of each node from the root to the node branch length (path length), the number of children and grandchildren an
ALGO2-2
- Algo2-2.c C program for implementing Algorithm 2.2 Algorithm translated to C by: Dr. Norman Fahrer IBM and Macintosh verification by: Daniel Mathews NUMERICAL METHODS: C Programs, (c) John H. Mathews 1995 To accompany the text: NU
ALGO2-3
- Algo2-3.c C program for implementing Algorithm 2.3 Algorithm translated to C by: Dr. Norman Fahrer IBM and Macintosh verification by: Daniel Mathews NUMERICAL METHODS: C Programs, (c) John H. Mathews 1995 To accompany the text: NUM
NR_C301
- Numerical.Recipes-数值算法 最著名的常用数值算法程序集，C++及C形式的源代码 1 Preliminaries 2 Solution of Linear Algebraic Equations 3 Interpolation and Extrapolation 4 Integration of Functions 5 Evaluation of Functions 6 Special Functions 7 Random Number
kpingfangsuanfa
- 一种利用8位单片机进行开平方运算的高速算法-8-bit microcontroller by means of a high-speed algorithm for square root
BlockMatchingAlgoMPEG
- Block Matching Algorithms for Motion Estimation This project contains the project report and source code by Aroh Barjatya for Digital Image Processing Class at Utah State University. Following is a short descr iption of the m files in this
QBS
- 钱伯斯——三点迭代公式，同抛物线法一样可以求方程的根。-Chambers- 3:00 iteration formula, with the parabola method can still seek the root of equations.
falspos
- root finding by false position
huffman_encode
- 功能是基于赫夫曼树的数据结构的文本压缩，根据生成的HuffmanTree来产生字符的编码.即从叶子到根逆向求每个字符的Huffman编码。 -Function is based on the Huffman tree data structure of the text compression, according to the generated HuffmanTree to generate the character codes. That is, from leaf to the r
huffman_encode
- 功能是基于赫夫曼树的数据结构的文本压缩，根据生成的HuffmanTree来产生字符的编码.即从叶子到根逆向求每个字符的Huffman编码。 -Function is based on the Huffman tree data structure of the text compression, according to the generated HuffmanTree to generate the character codes. That is, from leaf to the roo
mullertest
- 改进的muller算法 当中不用判断 直接考虑了复数根的情况 并包含一个例子-Improved muller algorithm to determine which do not directly take into account the complex situation in the root and contains an example
my_BFS
- 1. Enqueue the root node. 2. Dequeue a node and examine it. * If the element sought is found in this node, quit the search and return a result. * Otherwise enqueue any successors (the direct child nodes) that have not yet been discovered.
lz78
- LZ78字典压缩算法的原理实现文件的压缩及解压,需要在d盘根目录下建立a.txt文件作为压缩的源文件-LZ78 dictionary compression algorithm to achieve the principle of the file compression and decompression, the need d established under the root directory a.txt file as a compressed source file
BinaryTree
- 数据结构经典实例，深入了解二叉树。如：可查询每个节点的层次，从根到该节点的枝长（路径长度），子孙的个数及祖先的个数。每个节点在前序、中序、后序中的访问的序号。-Classic examples of data structures, in-depth understanding of binary tree. Such as: to check the level of each node, the node from the root to shoot length (path length)