CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - OBST
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - OBST - List
[
CSharp
]
OBST
DL : 0
我用C++编写的二分最优查找!希望大家能用的着!-prepared by the two sub-optimal search! The hope everyone can be with! Thank you! !
Update
: 2008-10-13
Size
: 984byte
Publisher
:
于飞
[
CSharp
]
OBST
DL : 0
我用C++编写的二分最优查找!希望大家能用的着!-prepared by the two sub-optimal search! The hope everyone can be with! Thank you! !
Update
: 2025-02-17
Size
: 1kb
Publisher
:
于飞
[
Algorithm
]
obst
DL : 0
ooptimal binary search tree algorithm using dynamic approach
Update
: 2025-02-17
Size
: 1kb
Publisher
:
manoj
[
MultiLanguage
]
OBST
DL : 0
Optimal binary search tr-Optimal binary search tree
Update
: 2025-02-17
Size
: 1kb
Publisher
:
abocs1984
[
Mathimatics-Numerical algorithms
]
OBST
DL : 0
计算机算法基础书本中的OBST算法VC++代码实现-Computer algorithm-based books in the OBST algorithm VC++ code
Update
: 2025-02-17
Size
: 69kb
Publisher
:
ldyue
[
Other
]
obst
DL : 0
最小生成树 OBST算法实现 C语言实现-Minimum spanning tree the OBST algorithm to achieve C language
Update
: 2025-02-17
Size
: 1kb
Publisher
:
李殷
[
CSharp
]
OptimalBinarySearchTree
DL : 0
vs2010实现的OBST算法,最优二叉搜索树 实现功能: 1、文件读取,手动输入,数据更新。 2、p/q表数据保留,便于手动添、删或修改 3、最优解的二叉树结构显示 文件读取示例文档在压缩包内-vs2010 achieve OBST algorithm, optimal binary search tree implementation functions: 1, file read, manually entered data updates. 2, p/q table data retention, easy to manually add, delete or modify the three, the optimal solution to read binary tree displays the file in compressed within the sample document
Update
: 2025-02-17
Size
: 106kb
Publisher
:
zty
[
Data structs
]
OBST
DL : 0
尝试用贪心算法和动态规划算法构造最优二叉搜索树,并做基本统计分析和比较。结论是贪心算法不能保证构造出最优,也没有好的效率;动态规划明显更好。-Use greedy algorithm and dynamic programming to build optimal binary search tree. And related statistics and comparison are provided in report.
Update
: 2025-02-17
Size
: 500kb
Publisher
:
李进
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.