Location:
Search - btr
Search list
Description: 排序算法、字典和B-树的C++语言实现
代码内容 包括以下算法：
qui.c sort: quicksort
qsort.c sort: qsort
ins.c sort: insert sort
shl.c sort: shell sort
has.c dictionary: hash tables
bin.c dictionary: binary tree
rbt.c dictionary: red-black trees
skl.c dictionary: skip lists
ext.c external sort
btr.c btree
语言 C++
编译平台 Visual C++
作者 Thomas Niemann
备注 来自Sorting and Searching Algorithms:A Cookbook-algorithm, dictionaries and B-Tree C language code include the following algorithm : qui.c sort : quicksort qsort.c sort : qsort ins.c sort : insert sort shl.c sort : shell sort has.c dictionary : hash tables bin.c dictionary : binary tree rbt.c dictionary : red-black trees skl.c dictionary : skip lists ext.c external sort btr.c BTREE Part C language Visual C platform translated author Thomas Niemann Remarks from the Sorting and S earching Algorithms : A Cookbook
Platform: |
Size: 24943 |
Author: 罗鹏魁 |
Hits:
Description: 用c语言实现的b树-use the C Language b tree
Platform: |
Size: 41662 |
Author: 关文 |
Hits:
Description: 排序算法、字典和B-树的C++语言实现
代码内容 包括以下算法：
qui.c sort: quicksort
qsort.c sort: qsort
ins.c sort: insert sort
shl.c sort: shell sort
has.c dictionary: hash tables
bin.c dictionary: binary tree
rbt.c dictionary: red-black trees
skl.c dictionary: skip lists
ext.c external sort
btr.c btree
语言 C++
编译平台 Visual C++
作者 Thomas Niemann
备注 来自Sorting and Searching Algorithms:A Cookbook-algorithm, dictionaries and B-Tree C language code include the following algorithm : qui.c sort : quicksort qsort.c sort : qsort ins.c sort : insert sort shl.c sort : shell sort has.c dictionary : hash tables bin.c dictionary : binary tree rbt.c dictionary : red-black trees skl.c dictionary : skip lists ext.c external sort btr.c BTREE Part C language Visual C platform translated author Thomas Niemann Remarks from the Sorting and S earching Algorithms : A Cookbook
Platform: |
Size: 24576 |
Author: 罗鹏魁 |
Hits:
Description: Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.-Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in whic
Platform: |
Size: 87040 |
Author: 高名 |
Hits:
Description: 一个很好的整站系统,对学习vbscript,javascript有很大帮助.-a good point for the entire system, to learn Perl, javascript be of much help.
Platform: |
Size: 239616 |
Author: lee |
Hits:
Description: java版b树源码，已经调试过，很好，很强大，希望对大家有所帮助。-b tree java source version has debugging, and very good, very powerful and we hope to be helpful.
Platform: |
Size: 7168 |
Author: willee |
Hits:
Description: can网络参数计算工具合集,包含一个SJA1000通讯参数计算器,LPC系列Arm通讯参数计算器,还有一个能计算Atmel-89C51CC01,英飞凌全系列Can控制器,MicroChip MCP25XX,Motorola 68HC05,飞利浦全系列Can控制器,TI TMS320系列DSP内置Can控制器等芯片的通讯参数和Can网络最大通讯距离的超级强大的计算工具,实在是Can网络开发的必备工具-Collection computational tools can network parameters, including a SJA1000 communication parameter calculator, LPC series of Arm communication parameters calculator, there is an energy calculations Atmel-89C51CC01, Infineon Can a full range of controllers, MicroChip MCP25XX, Motorola 68HC05, Philips Pu Can a full range of controllers, TI TMS320 series DSP chip built-Can controller communication parameters and the largest telecommunications network distance Can super powerful computing tools, it is an indispensable tool for network development Can
Platform: |
Size: 339968 |
Author: 柯岚 |
Hits:
Description: ADO 使用详解
对使用ADO进行数据库连接做了比较详细的介绍 附带了一些实例-Detailed Explanation on the use of ADO with ADO for database connection to do a more detailed description with some examples
Platform: |
Size: 26624 |
Author: jie |
Hits:
Description: Tree animations including Btr-Tree animations including Btree
Platform: |
Size: 93184 |
Author: Yavuz |
Hits:
Description: C#读取串口数据，并校验数据完整性和计算读取数据速度-C# read data from serial port, and verify data integrity, and calculate the speed of read data
Platform: |
Size: 12288 |
Author: 禹 |
Hits:
Description: c++实现的b+树源代码，由basetree生成出Btr-b plus tree completed by c++
Platform: |
Size: 9216 |
Author: xun |
Hits: