资源列表
排序选择:
ccc
- 在二叉搜索树上删除一个有两个子女的结点时,可以采用以下三种方法: (1) 用左子树TL上具有最大关键码的结点X顶替,再递归地删除X。 (2) 交替地用左子树TL上具有最大关键码的结点和右子树TR上具有最小关键码的结点顶替,再递归地删除适当的结点。 (3) 用左子树TL上具有最大关键码的结点或者用右子树TR上具有最小关键码的结点顶替,再递归地删除适当的结点。可随机选择其中一个方案。 试编写程序实现这三个删除方法,并用实例说明哪一个方法最易于达到平衡化。 -In the bin
BBB
- 设有一个有向图存储在邻接表中。试设计一个算法,按深度优先搜索策略对其进行拓扑排序。并以右图为例检验你的算法的正确性。-There is a directed graph stored in the adjacent table. Trial design an algorithm, depth-first search strategy by the topology of its sort. And to test your example picture on the right algor
OgreMaxViewers
- 一个OFRE引擎中要用到的工具,用来观察mesh模型的渲染效果。-OFRE engine to use a tool, used to observe the mesh model rendering.
Ackerman
- 已知Ackerman函数定义如下: (1) 根据定义,写出它的递归求解算法; (2) 利用栈,写出它的非递归求解算法。 -Known Ackerman function is defined as follows: (1) By definition, a recursive algorithm to write it (2) the use of the stack, write its non-recursive algorithm.
meanshifttracking
- 跟踪-tracking
aaa
- 已知A[n]为整数数组,试写出实现下列运算的递归算法: (1) 求数组A中的最大整数。 (2) 求n个整数的和。 (3) 求n个整数的平均值。 -Known to A [n] is an integer array, try to write to achieve the following recursive algorithm for computing: (1) Find the largest integer in the array A. (2) Find n i
frequency
- 编写一个算法frequency,统计在一个输入字符串中各个不同字符出现的频度。用适当的测试数据来验证这个算法。-Write an algorithm frequency, statistics in an input string characters appear in different frequency. With the appropriate test data to verify the algorithm.
CORBA
- 有利于学习CORBA的人研究-Conducive to learning people of CORBA
ShuZhiSuanFa
- 数值分析中常用的经典算法,包括最小二乘、牛顿、高斯、龙贝格、拉格朗日、欧拉等算法的集合。-Commonly used in classical numerical analysis algorithms, including least squares, Newton, Gauss, Romberg, Lagrange, Euler and other collection algorithms.
rexxxengchushi
- 这本书教会我们的心灵适合在任何生活或工作换件下,都处于积极乐观向上的心态!-This book teaches us the mind fit for any living or working conditions, the are in a positive upbeat attitude!
lsakjdf
- 桌面特效~ 也曼占用内存的,给新手学习哦~ 按ESC退出-zhuomian texiao
lcd1602
- 该文件包含lcd1602驱动程序,rs232串口通信,环形缓冲数组。该程序为本人学生时期的练习习作。-This file contains lcd1602 driver, rs232 serial communication, a circular buffer array. During the program as my students practice exercises.