搜索资源列表
TrinomialAmerican
- 三叉树方法计算美式期权定价，更加精确而且计算速度增加。有关说明在文件中。-tree method trigeminal American option pricing, and more accurate calculation of the speed increase. The note in the document.
DPG
- 堆排序 一、 需求分析 问题定义： 假设定义堆为满足如下性质的完全三叉树：（1）空树为堆；（2）根结点的值不小于所有子树根的值，且所有子树均为堆。编写利用上述定义的堆进行排序的算法，并分析推导算法的时间复杂度。 -a heap sort, demand analysis definition : the assumption that to meet the definition of sculpture,
LJTHREE
- 假设定义堆为满足如下性质的完全三叉树：（1）空树为堆；（2）根结点的值不小于所有子树根的值，且所有子树均为堆。编写利用上述定义的堆进行排序的算法，并分析推导算法的时间复杂度。-assumptions to meet the definition of reactor following the complete nature of the trigeminal tree : (1) Air trees reactor; (2) The
wanquansanchashu
- 假设定义堆为满足如下性质的完全三叉树： (1) 空树为堆； (2) 根结点的值不小于所有子树根的值，且所有子树 均为堆。 编写利用上述定义的堆进行排序的算法，并分析推导 算法的时间复杂度。
3bitree
- 一个二叉树的三叉链表运用实例，求出叶子的结点并输出从根结点到该叶子结点的路径!-a binary tree using the trigeminal Chain example, the leaves are obtained and the output node from the Root of leaf nodes in the path!
TrinomialAmerican
- 三叉树方法计算美式期权定价，更加精确而且计算速度增加。有关说明在文件中。-tree method trigeminal American option pricing, and more accurate calculation of the speed increase. The note in the document.
DPG
- 堆排序 一、 需求分析 问题定义： 假设定义堆为满足如下性质的完全三叉树：（1）空树为堆；（2）根结点的值不小于所有子树根的值，且所有子树均为堆。编写利用上述定义的堆进行排序的算法，并分析推导算法的时间复杂度。 -a heap sort, demand analysis definition : the assumption that to meet the definition of sculpture,
Tree+Postorder
- 层次输入建立二叉树并后序遍历,三叉链式存储,递归遍历-import levels and the establishment of a binary tree after preorder, trigeminal chain store, recursive traversal
LJTHREE
- 假设定义堆为满足如下性质的完全三叉树：（1）空树为堆；（2）根结点的值不小于所有子树根的值，且所有子树均为堆。编写利用上述定义的堆进行排序的算法，并分析推导算法的时间复杂度。-assumptions to meet the definition of reactor following the complete nature of the trigeminal tree : (1) Air trees reactor; (2) The
balancetree
- 输入一组关键字序列，并以此顺序建立一棵平衡二叉树（提示：为简化运算，可采用含有左、右子树高度和指向父母的指针的三叉链表表示），并在建树过程中用逆中序法输出每次插入新结点后的平衡二叉树形状。-Enter a list of keywords sequence, and thus the order of the establishment of a balanced binary tree (Hint: To simplify the c
wanquansanchashu
- 假设定义堆为满足如下性质的完全三叉树： (1) 空树为堆； (2) 根结点的值不小于所有子树根的值，且所有子树 均为堆。 编写利用上述定义的堆进行排序的算法，并分析推导 算法的时间复杂度。-Assumptions are as follows to meet the definition of the nature of heap full trigeminal tree: (1) tree for the hea
HuffmanDecoder
- Huffman Decoder 哈弗曼编码器 C语言描述 数据结构与算法 利用三叉树-Huffman Decoder
opinion
- 三叉树欧式期权看涨,计算欧式期权价格很方便,还有B-S和二叉树-EuCallTrinomial
assign5
- 利用heap实现三叉树的组建，插入，排序。 分析推导 算法的时间复杂度。 - create a max heap class that is based on a complete ternary tree. As with a complete binary tree max heap, the largest value is at the root and the root is at location 1 in t
Caley
- Calery三叉树的MFC版本,具有深度广度以及高度的扩展-Calery trigeminal tree version of MFC, with the depth and breadth of the expansion of highly
CHAP04
- 这是数据结构的一些代码，包括一些最基础的一些源文件（二叉树、三叉树、顺序表、链式表等等），你们在网上是下载不到的、、、希望对你们有些帮助-This is a data structure of some of the code, including some of the most basic of some of the source file (binary, trigeminal tree, the order form, cha
search-tree
- 中文三叉树字典（Ternary Tree），可以用于分词，自动提示，查询速率与Hash Table相当,支持动态添加。-Chinese trigeminal tree dictionary (Ternary Tree), can be used for word, auto tips, check rates and Hash Table equivalent support for dynamically added.
Trinomial
- 基于三叉树的期权定价模型，包括路径依赖型，向下敲出期权等奇异期权-Trinomial tree option pricing model, including path-dependent, and down to knock out the options and exotic options
CRR
- 欧式、美式，二叉、三叉树定价，共4个。算法不含nchoosek，较优化。-Continental, American, binary, ternary tree pricing, a total of four. Algorithm without nchoosek, compared with optimizations.
Heap sorting
- 本程序可实现堆排序重构，用完全三叉树来实现堆排序中的堆(This program can achieve heap sort refactoring, and use full tri tree to achieve heap sort.)