搜索资源列表
ntree
- 设T 是一棵带权树，树的每一条边带一个正权。又设S 是T 的顶点集,T/S 是从树T 中 将S中顶点删去后得到的森林。如果T/S中所有树的从根到叶的路长都不超过d ，则称T/S 是一个d 森林。 (1)设计一个算法求T的最小顶点集S，使T/S是d 森林。(提示：从叶向根移动) (2)分析算法的正确性和计算复杂性。 (3)设T中有n 个顶点，则算法的计算时间复杂性应为O(n)。-based T is a right to bring a tree for every one o
PolynomialIncludingAllFunctions
- 一元多项式符号计算-含因式分解版 不仅包含+,-,*,/,多项式求值,数值积微分,(内含多项式求根子程序),定与不定积分,还有因式分解(求根法). 用单链表.输入格式按提示.-one yuan polynomial symbolic computation-containing factorization version not only contains ,-,*,/, polynomial evaluation, Numerical plot differential (intron
huizhong
- 实现所有经典排序算法汇总 包括选择排序、冒泡排序、快速排序、插入排序、希尔排序、归并排序、基数排序、计数排序、小根堆排序共9种算法。-Summary of the realization of all the classic sorting algorithms including the selection sort, bubble sort, quick sort, insertion sort, Shell sort, merge sort, radix sort, counting
h
- 哈弗曼树的介绍，关于树和根树的概念深化和重要应用-Havermann tree introduction, on trees and tree roots important application of the concept of deepening and
Heap
- 堆的基本操作，插入删除，把数组变为小根堆，并检查是否为小根堆，用小根堆排序的方法按降序对大小为n的数组进行排序。-The basic operation of the heap, insert delete the array into a heap of small roots, and check the heap for small roots, roots with a small heap sort in descending order by means of an array of
maintenance-of-of-binary-tree-VC
- 实现二叉排序树维护子系统实现，实现查找、插入、删除、修改操作。首先要建立一棵二叉排序树，建立树根，然后按照中序遍历依次建立二叉排序树。运用switch的四个case实现各个操作，每个case中调用相应的子程序。子程序是选择要进行的操作：查找、插入、删除、修改。-Binary sort tree maintenance subsystem to achieve, to achieve the find, insert, delete, and modify operations. First ne
2-3-tree
- 2—3树是这样一种树： A．每个非叶子结点都有2个或3个儿子； B．每条众树根到树叶的路径长度相等； C．只有一个根结点的树也是2—3树。 本题目要求从键盘输入以整数序列，建立一棵2-3树。所以我的建树构思为以2-3树的插入操作来进行建树。-2-3 tree is such a tree: A. Each non-leaf node has two or three sons B. Each congregation tree roots to leaves is equal
chengfahanshufa
- 惩罚函数法法，用于求解二维非线性方程的根，收敛速度快-Roots, convergence speed penalty function method method for solving the two-dimensional nonlinear equations
gongcheng
- 实现实数、复数、各种进制下的科学计算 大整数计算 线性代数计算 多项式求复数根的计算 多功能计算器-For all real Numbers, complex, in base of scientific computing Large integer calculation Linear algebra calculation The calculation of roots of polynomials and the plural Multi-functio
the-roots-of-quadratic-equations
- search for the roots of quadratic equations
Rebuild
- POJ 由中根和后根序列重建二叉树并由前根序列输出-POJ Central roots and root sequence reconstruction after anterior root binary sequence output
Task1
- n numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real-valued function.
REBUILD-BINARY-TREE.cpp
- 我们知道如何按照三种深度优先次序来周游一棵二叉树，来得到中根序列、前根序列和后根序列。反过来，如果给定二叉树的中根序列和后根序列，或者给定中根序列和前根序列，可以重建一二叉树。本题输入一棵二叉树的中根序列和后根序列，要求在内存中重建二叉树，最后输出这棵二叉树的前根序列。 用不同的整数来唯一标识二叉树的每一个结点，下面的二叉树 中根序列是9 5 32 67 后根序列9 32 67 5 前根序列5 9 67 32 -We know how to