Location:
Search - loser tree
Search list
Description: 本程序实现了败者树等外排序方式，封装性好，代码强壮-program of the master tree outer Sort, Packaging and good strong code
Platform: |
Size: 292864 |
Author: 14965a |
Hits:
Description: 用败者树算法实现外部排序操作，主要实现的操作有1.读取文件上的数据。2．输出排好序后的数据。3．输出败者树排序法排出的序列到"exsort.txt”。-Loser tree algorithm using the external sort operation, the main achievement of the operation have one. Read the document data. 2. Output row after a good sequence data. 3. Loser tree method to sort the output from the sequence to
Platform: |
Size: 623616 |
Author: 张娟 |
Hits:
Description: 本人自己编写的用于统计一堆文件单词数量的小工具，采用败者树归并算法，速度很快-I have written a pile of documents for statistical word number of small tools, the use of the loser tree merging algorithm, fast
Platform: |
Size: 1752064 |
Author: 华南 |
Hits:
Description: 先用内排序对随即产生的内n个3位数的整数排好序，存放在一个文件中，
共产生m个有序文件，然后对这m个文件利用败者树进行多路平衡归并，
得到一个有n*m个三位数的有序文件。-First in order to then generated within the n-3-digit integer row good order, stored in a document, generate a total of m months in an orderly file, and then use this m file loser tree balanced multi-way merging, be an n* m a triple-digit orderly documents.
Platform: |
Size: 1024 |
Author: 方宇浩 |
Hits:
Description: 外排序 对于海量数据进行快速排序 然后利用败者树进行归并的算法的一个模板-Outside the huge amount of data to sort for quick sort loser tree and then use the algorithm to merge a template
Platform: |
Size: 3072 |
Author: caj |
Hits:
Description: 根据严蔚敏数据结构(c语言版)实现的败者树算法, 程序内含测试数据的数组, 包含详细注释.
另外程序通过大数据量测试.-According to Yan Wei-min data structure (c language version) to achieve the loser tree algorithm, the program includes an array of test data, with detailed comments. Another large amounts of data through the testing process.
Platform: |
Size: 1024 |
Author: 魏巍 |
Hits:
Description: 网上找的一个败者树程序，和大家分享一下。编程环境是Visual Studio C++。-Internet looking for a loser tree program, and share with you. Programming environment is Visual Studio C++.
Platform: |
Size: 516096 |
Author: tiantian |
Hits:
Description: 败者树 c++ 我先来说一说败者树（loser tree）。也许有些人对loser tree不是很了解，其实它是一个比较经典的外部排序方法，也就是有x个已经排序好的文件，将其归并为一个有序序列 ...
-tree
Platform: |
Size: 1135616 |
Author: simon.yan |
Hits:
Description: 外部排序中，用败者树来实现K路合并。主要介绍如何实现合并。-Loser tree external sort using the merger to achieve K Road
Platform: |
Size: 1024 |
Author: tyq |
Hits:
Description: c++ 败者树（loser tree）。也许有些人对loser tree不是很了解，其实它是一个比较经典的外部排序方法，也就是有x个已经排序好的文件，将其归并为一个有序序列，-c++ loser tree (loser tree). Maybe some loser tree is not very understanding, in fact, it is a classic external sorting method, that is, x have to sort the good file, will be incorporated into an ordered sequence
Platform: |
Size: 528384 |
Author: 古志榮 |
Hits:
Description: 数据结构 Loser Tree 的示例，包含源文件和可执行文件，以及整个VS2008的项目文件-Loser Tree data structure example, contains the source files and executable files, as well as the entire VS2008 project file
Platform: |
Size: 2675712 |
Author: xiaox010 |
Hits:
Description: 严蔚敏 数据结构 K路归并+败者树实现外部排序-YanWeiMin K Road merge data structure to achieve external sort+ loser tree
Platform: |
Size: 248832 |
Author: 周牒岚 |
Hits:
Description: 设记录R[i]的关键字为R[i].KEY（1<=i<=k），树结点T[i]（1<=i<=K-1）指向败者记录，T[0]为全胜记录下标。写一算法产生对应上述R[i]（1<=i<= k）的败者树，要求除R[1..k]和T[0..k-1]以外，只用O(1)辅助空间。-Setting the recording R [i] is a keyword R [i] .KEY (1 < = i < = k), the tree node T [i] (1 < = i < = K-1) points loser record, T [0] is unbeaten record label. Corresponding to the above-described algorithm produces a write R [i] (1 < = i < = k) loser tree requires in addition R [1..k] and T [0..k-1] except using only O (1 ) auxiliary space.
Platform: |
Size: 1024 |
Author: 神奇 |
Hits:
Description: 败者树的C++源码，败者树实际上是一棵完全二叉树，可以看做是胜者树的一种变体。-C++ source of loser tree.
Platform: |
Size: 1853440 |
Author: licl |
Hits: