搜索资源列表
buy
- 网上购物子系统，在最新的Eclipse版本上开发完成, 采用了JSP、Servlet、Struts、Hibernate、Spring及Ajax等众多技术,数据库使用的是MySQL，其版本为5.0.45 版本。 数据库的用户名及密码均为root。 -Online shopping subsystem, in the latest version of Eclipse on the development of complete, using JSP, Servlet, Struts, Hi
chap17
- 对任意一个实数，可以利用它来求平方根，怎么这么麻烦啊？-For any real number, you can use it to order the square root, how can such a trouble ah?
path
- 找出（二叉树中）从根结点到任一给定的结点的路径（非递归实现）-To find (in Binary Tree) from the root node to any given node of the path (non-recursive implementation)
cmorph0
- Tracking Algorithm: Object Delineation Method Files: Cmorph02.m Current version of tracking algorithm Parsampleflowgrav050901b1.m Sample parameter file 一种跟踪方法 国外网站转载-Instructions: Download the tracking algorithm and sample parameter file
szfx2
- 数值分析之计算方法与实验2：方程求根 by java-Numerical analysis method of calculation and experiment 2: Root equation by java
RecordScreen
- 截取屏幕,保存到C盘根目录下.小程序,入门混分.-Interception of the screen, saved to the C root directory. Applet, mixed entry points.
CatchScreeen
- 截取屏幕,默认保存到C盘根目录,可让用户修改保存目录.-Interception of the screen, the default root directory is saved to C to allow users to modify the save directory.
fft
- 混合基FFT算法的C语言实现，采用了多层子函数调用-multi-root fft algorithm
formulatest
- C++求高次方程根问题，国外最新算法，改进型算法-Equation for the root problem of high
HUFFMAN
- 建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.
SFE
- 建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.
Newton
- 这是一个用java高级编程语言编写的程序，能够实现用牛顿迭代法求解某个函数在某个指定区间内的根，方便易用。-Java This is a high-level programming languages used in the preparation of procedures, be able to achieve with Newton iteration to solve a function in a specified range of root and user-friendly.
2008638621518
- 树是由n(n≥0)个结点组成的有限集合T。n=0的树称为空树；对n>0的树，有:(1)仅有一个特殊的结点称为根结点，根结点没有前驱结点；(2)当n>1时，除根结点外其余的结点分为m(m>0)个互不相交的有限集合T1,T2，…，Tm，其中每个集合Ti本身又是一棵结构和树类似的子树。 -Tree is n (n ≥ 0) consisting of nodes finite set T. n = 0 of the tree known as the empty tree fo
ch08
- 堆積（heap）是樹結構的第三種型態。堆積是一棵二元樹，其左右子樹節點的值均較其父母節點的值小。堆積的根節點值保證是該樹最大值。這中堆績稱為最大堆績。堆積的子樹可擺在左邊當左子樹，也可擺在右邊當右子樹，因此左右子樹俱有相同的性質。-Heap (heap) are the third type of tree structure. Accumulation is a binary tree, its about the value of subtree nodes than those of th
ch
- 堆积（heap）是树结构的第三种型态。堆积是一棵二元树，其左右子树节点的值均较其父母节点的值小。堆积的根节点值保证是该树最大值。这中堆绩称为最大堆绩。堆积的子树可摆在左边当左子树，也可摆在右边当右子树，因此左右子树俱有相同的性质。-Heap (heap) are the third type of tree structure. Accumulation is a binary tree, its about the value of subtree nodes than those of th
ccc
- 这是我编的利用连分式方法计算任意正数根号值的程序。-This is for my use of any continued fraction method is its root value of the number of procedures.
fzsdiancha
- JSP+server2000环境!调查系统，有一个好的后台! 解压文件后，将diaocha这个文件放到你的网站根录下，首面页调用的页面是index1.jsp,用JS调用即可! -JSP+ server2000 environment! Investigate systems, there is a nice background!-Extracting file, it will put you diaocha this document recorded in the web roo
squarefun
- this for square root program to fine square root for any real number
Huffmatreeofdatastructure
- 哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的路径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路径长度记为WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln)，N个权值Wi(i=1,2,...n)构成一棵有N个叶结点的二叉树，相应的叶结点的路径长度为Li(i=1,2,...n)。可以证明哈夫曼树的WPL是最小的。-Huffman tree is also called the op
rootlocus
- Root Locus Design solve method(very easy and faster)