搜索资源列表
cn2.0
- The method of bisection for finding the root of an equation.
2
- 二叉排序树的创建与使用 (时间限制为：1000毫秒) 描述： 二叉排序树的定义是：或者是一棵空树，或者是具有下列性质的二叉树：（1）若它的左子树不空，则左子树上所有的结点值均小于它的根结点的值；（2）若它的右子树不空，则右子树上所有结点的值均大于或等于它的根结点的值；（3）它的左右子树也分别为二叉排序树。现要求根据输入的元素值，构造一棵二叉排序树，并输出其先序遍历、中序遍历和后序遍历结果。 输入： 输入第一行为测试用例个数n，接下来为n个测试用例，每个测试用例占两
Mult15X32
- 主要实现加法迭代，减少乘法和开方运算，提高运算速度-Major iteration to achieve additive to reduce the multiplication and square root operations, and improve processing speed
erfenfa
- 二分法的基本思想是通过计算隔根区间的中点，逐步缩小隔根区间，从而可以得到方程的近似值-The basic idea of dichotomy is separated by calculating the midpoint of the root zone, gradually narrowing the range across the root, so you can get an approximation of equation
bittree_show
- 链表结点二叉树实现,通过建立树和遍历树,真正实现二叉树的树状显示,根结点在最上面,用c实现,通过计算结点位置放置结点.需要的可以参考!-Binary Tree node list, through the establishment of trees and tree traversal, binary tree truly show the root node at the top, with c achieved by calculating the node position to pla
BestFirstSearch_HeapAlgo
- 1. 此程式執行將從路徑讀取一個文字檔 ( 路徑：C:INPUT.TXT ) 2. 執行結束會產生一個排序後的文字檔 ( 路徑：C:OUTPUT.TXT ) 3. 給定的初始盤面一定有解 本程式採用的演算法策略為Best-first search with branch-and-bound algorithm 1. 使用Max heap 實作Priority queue 2. 使用bound function 估計目前盤面走至答案最少需要幾步 第一部分 所謂 h
newtn
- 牛顿法解决求根问题。给出所需要求根的方程，以及搜索步长，搜索步数，输出所求得的根值。-Newton s method for solving the root of equation. Inputs: eqation, step lenth, number of steps.
calculation_method_Algorithm_Design_and_Implementa
- 本电子书包涵了各种算法的MATLAB实现，具体包括插值方法、数值分析、常微分方程的差分法、方程求根、线性方程组的迭代法、线性方程组的直接法等等，还包括习题参考答案和MATLAB文件汇集-The e-book encompasses the MATLAB implementation of various algorithms, specifically including interpolation methods, numerical analysis, ordinary differenti
SqrtNdigit
- 求x的算术平方根，保留N位有效数字，并返回算术平方根的平方-solving the square root of x with N digits Significant figures, and saving the Square root of the square
RecSqRoot
- implementation of the reciprocal and square root approximation methods for fixed point processors
1
- 写一个 函数，求方程ax2+bx+c＝0的根，从主函数中输入a、b、c的值。-Write a function, find the equation ax2+ bx+ c = 0 of the root, the main function from the input a, b, c values.
two_three_not_noise_RMSE_90_60
- 比较俯仰角度分别为60°，90°，以及极化参数为60°和90°时的三极子天线和两极子天线的均方根误差-Comparison of tilt angles of 60 °, 90 °, and the polarization of 60 ° and 90 °, three-pole antenna and polarization Antenna root mean square error
root
- 全面考虑各种情况，求解一元二次方程的解。只有核心代码，加mian函数即可运行-To consider all the circumstances, the solution for solving a quadratic equation. Only the core code, plus mian function to run
xinxishang
- 计算故障分类的每个属性的信息熵，选取最大的作为根节点-For fault classification information entropy of each attribute, select the largest as the root
C150examples
- 求最大值，求根，求三角形面积等自编程序。-The Maximum, Root, triangle area, and other self seeking process.
number
- 牛顿插值，拉格朗日插值，还有方程根的计算，还有求矩阵特征值的malab代码-Newton interpolation, Lagrange interpolation, there is the root of the calculation equation, there is a matrix eigenvalue malab code
x
- visualC++环境下，完成的求数值平方根的算法-visualC++ environment, complete the square root of the algorithm in numerical
searchroot
- 写程序求一元二次方程的解(C++入门程序,比较菜)-root
test
- raise cosine filter, rectangular root cosine in simulink
cubicroot
- 求一个实数的立方根的算法，用C++来实现，不是很难-Seeking the cube root of a real algorithm, using C++ to implement, not difficult