搜索资源列表
bstcnt(1)
- 二叉搜索树(Binary Search Tree)是满足如下性质的二叉树： ①若它的左子树非空，则左子树上所有结点的值均小于根结点的值； ②若它的右子树非空，则右子树上所有结点的值均大于根结点的值； ③左、右子树本身又各是一棵二叉搜索树。-Binary Search Tree (Binary Search Tree) is to meet the nature of the binary tree as follows: ① If its non-empty left subtree
autophp
- 全自动PHP环境搭配软件，本程序MYSQL默认用户名和密码均为:root-PHP environment with fully automated software, the program default MYSQL username and password are: root
1
- 本程序可求用户定义的函数在指定区间上的根，编程时以f（x）=x^3为例 使用时只需修改f的定义即可-This procedure rectifiable user-defined functions in the specified interval on the root, programming when f (x) = x ^ 3 as an example when used only to modify the definition of f
1
- 在一般的数据结构的书中，树的那章后面，著者一般都会介绍一下哈夫曼(HUFFMAN)树和哈夫曼编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛，如JPEG中就应用了哈夫曼编码。 首先介绍什么是哈夫曼树。哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的路径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路径长度记为WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln)，N
sqrt
- 求解正数的算数平方根，非c语言自带函数！-Solution is the square root of the number of counts, non-c language of its own function!
tdsp0.5.tar
- “ tdsp ”是一个C + +为基础的框架，仿真和评价各种信号处理方面的问题。这是completly写在C + + ，是根据“根”框架（ http://root.cern.ch ） 。 TDSP包括C + +类的程度根级氟-"tdsp" is a C++ based framework for the simulation and evaluation of various signal processing aspects. It is completly written in C++ an
ali2
- process a math string & find the 4th root
Chapter_6_Advanced_experiments_part1
- 周立功magic2410实验箱源码 第6章Linux高级实验(part1) 6.1 Linux内核编译实验 6.2 Linux根文件系统实验 6.3 CAT1025读/写实验. 6.4 ZLG7290键盘读取 6.5 USB-E2PROM编程器实验 6.6 SD/MMC卡实验 6.7触摸屏实验 6.8 PCMCIA接口CF卡实验 -Magic2410 week experimental box Ligong source Linux High Chapte
sqr16
- Find out 16 bit number square root. Asm51 source
testProgLinkedQueu
- 每个组件的side都是相对于它的父组件 (也就是说,button的side是在frame中的side,而跟root没有直接联系)-Side of each component are compared with its parent component (that is, button in the frame of the side of the side, and there is no direct contact with the root)
FibinacciNumber
- 最后调用 root 的 mainloop 方法 . 它进入 Tk 事件循环(event loop), 这样,应用程序将等待,直到 quit 方法被调用 (就是点击 QUIT button), 或者窗口被关闭. -Finally, call the mainloop method root. It into the Tk event loop (event loop), so, the application will wait until the quit method is called
LabManual
- 最后调用 root 的 mainloop 方法 . 它进入 Tk 事件循环(event loop), 这样,应用程序将等待,直到 quit 方法被调用 (就是点击 QUIT button), 或者窗口被关闭. -Finally, call the mainloop method root. It into the Tk event loop (event loop), so, the application will wait until the quit method is called
binary_tree_characters
- 程序确定二叉树的特征。如：每个节点的层次，从根到该节点的枝长（路径长度），子孙的个数及祖先的个数。每个节点在前序、中序、后序中的访问的序号。-Procedures to determine the characteristics of binary tree. Such as: the level of each node, the node from the root to the branch length (path length), the number of generations a
MPSKTransmission
- 有关MPSK调制，传输模型。成型脉冲分为矩形，升余弦脉冲，平方根升余弦脉冲。M的值为2，4和8.所加噪声是高斯白噪声。-Of the MPSK modulation, transmission model. Pulse shape is divided into rectangular, raised cosine pulse, the square root raised cosine pulse. The value of M for 2,4 and 8. The increase in n
math
- 非线性方程求根的各种算法的比较， //求非线性方程的根 //程序中共给出了以下几种方法求非线性方程的根 // (1)二分法 (2)牛顿法 (3)普通迭代法 (4)斯蒂芬森迭代法 (5)弦截法 //程序中用到的函数为： f(x)=x^3-x-1 //其中:(1)普通迭代法用的迭代函数为：x=(x+1)^(1/3) // (2)斯蒂芬森迭代法用的迭代函数为：x=x^3-1-Root of all kinds of non-linear equation algorithm,/
sqrt
- 自己写的算平方根的函数sqrt，并且用C库的sqrt进行了验证，十分精确。可以用在没有math库的情况，尤其是嵌入式程序中。-My own function of the square root of the operator sqrt, and use C library sqrt verified, highly accurate. It can be used in case there is no math library, in particular the embedded prog
judge
- 用汇编语言实现判断二元一次方程是否有根，输入为一次的系数-Using assembly language to achieve the dual一次方程to determine whether there is any root, enter the coefficient for the first time
newton
- newton method 用迭代法计算root.数值计算的常用方法之一。-newton method： use iteration to calculate the root of a fuction. It is a common used method.
Dijkstra
- Set的实现是通过２叉排序树来实现，就是将所有的元素用一个树来存储，根元素大于左子树的元素，小于右子树的元素，所有的操作都是基于这个树，通过判断元素的大小来选择对左子树操作还是右子树操作，这样操作数量和树的层数成正比-Set by the realization of two binary sort tree to achieve, that is, all the elements to store a tree, the root element is greater than the le
xianxingfangchengzuqiugen
- 线性方程组求根实验，分别用平方根法，Jacobi迭代法（不收敛），SOR三种方法，包含实验报告-Root experimental system of linear equations, respectively, with the square root method, Jacobi iterative method (not convergence), SOR three methods, including test reports