搜索资源列表
wangxinwen
- 树的建立,各种遍历(先根递归,先根非递归,中根递归,中根非递归,后根递归,后根非递归,层次遍历,最近公共祖先的查找,树的删除-tree establishment of various traverse (first - recursive and non - recursive first root, root recursive and non - recursive root, root recursive, non - recursive root level, traverse, th
Complete_binary_tree
- 在完全二叉树中，在层次遍历和先根序遍历中，已知某节点在一种遍历中的编号，求该节点在另一种遍历中的编号.-Complete binary tree in level order traversal and first traversal of the root, known to a certain node in a traversal of the code, and the node in a traversal of the code.
BST
- A Complete Binary Search Tree Program including insertion, deletion at root, leave or any node.
3_2
- 应用指针变量实现字符串的逆序显示：① +，-，*，/，^，| 分别代表加、减、乘、除、乘方、开平方。 ② 输入上述符号，输入则显示“你操作有误！”，然后退出程序； 如果输入正确，则提示用户输入相应的数据，然后进行计算并 显示结果。-Application of the reverse pointer for string variables showed: ①+,-,*,/,^,| representing addition, subtraction, multiplicat
Bisection-Method
- this a c sharp program called bisection method. this application will help you to determine the root of a polynomial.-this is a c sharp program called bisection method. this application will help you to determine the root of a polynomial.
solve-the-equation-root
- Dichotomy method to solve the equation root Microsoft Visual Studio Solution File, Format Version 11.00 # Visual Studio 2010 Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "二分法求解方程的根", "二分法求解方程的根\二分法求解方程的根.vcxproj", "{D9669C97-34C5-4009
Dichotomy-and-square-root
- 用二分法求平方根：通过每次把f(x)的零点所在小区间收缩一半的方法，使区间的两个端点逐步迫近函数的零点，以求得零点的近似值-Dichotomy and square root
UsnJournalDemo_ITeye
- 读取指定盘符下的USN日志，并且显示出根目录下所有文件的日志的id等USN日志信息-Read the the USN journal under the specified drive and display a log of all files in the root directory id USN journal
ID3_src
- Decision tree builds classification or regression models in the form of a tree structure. It breaks down a dataset into smaller and smaller subsets while at the same time an associated decision tree is incrementally developed. The final result is a t
fangcheng
- 解一元二次方程,在复数范围内求解，并能输出根的个数。- Avoids solving quadratic equation, in solving complex scope, and can output the number of root.
forequation
- 用于计算方程的根，方法为二分法。根据数值计算书上编写的程序。-Root method used to calculate the equation of dichotomy. The book value calculated in accordance with written procedures.
LiFangGen
- 不利用库函数实现求立方根，根据泰勒公式求得。C语言实现-Do not use the library functions achieve for the cube root, according to the Taylor formula obtained. C language
1818_SqRtAsm7
- Integer Square Root with Remainder
Calculator
- 该程序支持四则混合运算，无限表达式长度，支持（2560位）超大数运算、求模运算、乘方运算、开方运算等实用功能。-The program supports four mixed computing expressions, unlimited length, support (2560) large number of calculations, modulo operation, power operation, square root operation utility function.
FindTargetAndReturnPathInBinaryTree
- 实现了在二叉树中找到定值的所有路径的结果。路径是指从根节点到叶子节点的所有节点。-Results found all paths to achieve a given value in the binary tree. Path refers to all nodes the root to the leaf nodes.
acbrt.c
- Fast approximate cube root of a float.
asqrt.c
- Fast approximate square root of a float.
C4-3
- 对于一元二次方程ax^2 + bx + c 0,解可以分为很多情况。 若该方程有两个不相等实根，首先输出1，换行，然后从小到大输出两个实根，换行； 若该方程有两个相等实根，首先输出2，换行，然后输出这个这个实根，换行； 若该方程有一对共轭复根，输出3，换行； 若该方程有无解，输出4，换行； 若该方程有无穷个解，输出5，换行； 若该方程只有一个根，首先输出6，换行，然后输出这个跟，换行；-For a quadratic equation