Description: 二路合并排序算法，使用分治策略,时间复杂度O(nlog2n),
需要和待排记录等数量的辅助空间，是一种稳定的排序算法-two-way merge sorting algorithm, the use of divide-and-conquer strategy, the time complexity O (nlog2n) Pai and the need to record the number of auxiliary space, is a stable Sort Algorithm Platform: |
Size: 3861 |
Author:mxm |
Hits:
Description: 1）实现以下常用的内部排序算法并对它们的时间效率进行比较：
必做（6种）：起泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、堆排序；
选做：折半插入、二路归并、基数排序等等；
2）函数首部要求：void XXXXSort(char **list, int len, int n, int *c, int *s)
其中：
a) XXXXSort为排序函数名，具体如下：
起泡排序BubbleSort
直接插入排序InsertSort
简单选择排序SelectSort
快速排序QuickSort
希尔排序ShellSort
堆排序HeapSort
折半插入BInsertSort
二路归并Merge2Sort
基数排序RadixSort
b) list为二维字符数组的头指针，该二维数组的规格为：char list[n][len] 每行用于存放一个字符串（最大长度为len-1），共n行；
c) c用于返回关键字比较次数；
d) s用于返回移动次数；
3）要求把各种排序函数做成函数库（文件名统一为：sort.c），用统一提供的主程序进行调用和测评。
-a) achieve the following commonly used internal sorting algorithm as well as their time efficiency comparison : regimen (6) : bubble sort, direct insertion sequence and simple choice sorting, quick sort, Hill, ranked Heap Sort; elected to do : half of insertion, two-way merge. Sort base, and so on; 2) function first requirement : void XXXXSort (char ** list, int len, int n, int * c, int * s) which : a) XXXXSort sort of a function name, as follows : bubble sort BubbleSort direct insertion sort InsertSort simple choice ranking Sele ctSort Quick Sort QuickSort Hill Sorting ShellSort Heap Sort HeapS ort half insert BInsertSort two-way merge Merge2Sort radix sort Radi xSort b) list for the two-dimensional array of characters in the first indicator, the two-dimensional array specifications : cha Platform: |
Size: 10289 |
Author:战天 |
Hits:
Description: 二路合并排序算法，使用分治策略,时间复杂度O(nlog2n),
需要和待排记录等数量的辅助空间，是一种稳定的排序算法-two-way merge sorting algorithm, the use of divide-and-conquer strategy, the time complexity O (nlog2n) Pai and the need to record the number of auxiliary space, is a stable Sort Algorithm Platform: |
Size: 4096 |
Author:mxm |
Hits:
Description: 1）实现以下常用的内部排序算法并对它们的时间效率进行比较：
必做（6种）：起泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、堆排序；
选做：折半插入、二路归并、基数排序等等；
2）函数首部要求：void XXXXSort(char **list, int len, int n, int *c, int *s)
其中：
a) XXXXSort为排序函数名，具体如下：
起泡排序BubbleSort
直接插入排序InsertSort
简单选择排序SelectSort
快速排序QuickSort
希尔排序ShellSort
堆排序HeapSort
折半插入BInsertSort
二路归并Merge2Sort
基数排序RadixSort
b) list为二维字符数组的头指针，该二维数组的规格为：char list[n][len] 每行用于存放一个字符串（最大长度为len-1），共n行；
c) c用于返回关键字比较次数；
d) s用于返回移动次数；
3）要求把各种排序函数做成函数库（文件名统一为：sort.c），用统一提供的主程序进行调用和测评。
-a) achieve the following commonly used internal sorting algorithm as well as their time efficiency comparison : regimen (6) : bubble sort, direct insertion sequence and simple choice sorting, quick sort, Hill, ranked Heap Sort; elected to do : half of insertion, two-way merge. Sort base, and so on; 2) function first requirement : void XXXXSort (char** list, int len, int n, int* c, int* s) which : a) XXXXSort sort of a function name, as follows : bubble sort BubbleSort direct insertion sort InsertSort simple choice ranking Sele ctSort Quick Sort QuickSort Hill Sorting ShellSort Heap Sort HeapS ort half insert BInsertSort two-way merge Merge2Sort radix sort Radi xSort b) list for the two-dimensional array of characters in the first indicator, the two-dimensional array specifications : cha Platform: |
Size: 10240 |
Author:战天 |
Hits:
Description: K路归并算法，用贪心算法构造霍夫曼树，采用加入虚节点的思想求出最优的归并模式-K Road, merge algorithm, greedy algorithm using Huffman tree constructed using the idea of adding virtual nodes to derive the optimal merging pattern Platform: |
Size: 3072 |
Author:taolizao |
Hits:
Description: 用归并的算法思想实验文件的k路归并，代码为文件k路归并的c语言实现-Thinking of merging algorithm with the experimental k-way merge document, code k way merge for files of c language Platform: |
Size: 1024 |
Author:张富强 |
Hits:
Description: K路归并算法
* 本程序用来实现K路归并算法
* 在Turbo C2.0编译器下编译通过
* 算法过程中
* K由用户输入
* 用户选择需要归并的数据的个数
* 由程序生成随机数据，数据结构为链表，并展示给用户
* 然后程序告诉用户需要增加的虚节点的个数
* 并把虚节点加入到链表中去，最后进行归并
-K Road merge algorithm* This procedure used to realize the way merging algorithm for K* in Turbo C2.0 compiler compiler under the process through the* algorithm* K* by the user input the user select the number of merging the data* generated by the random data , data structure for the list, and display to the user* and then the procedure to tell the user the need to increase the number of virtual nodes and virtual nodes* added to the list going, and finally to merge Platform: |
Size: 2048 |
Author:zhoutianshu |
Hits:
Description: 很多种知名公司的面试题，大多是算法问题，用C++编写的源码，还有一些比较难的问题的解答，例如：两路归并排序，-Are many well-known companies face questions, mostly algorithm issue, C++ Prepared source, there are some of the more difficult questions, such as: two-way merge sort Platform: |
Size: 20480 |
Author:nicai |
Hits:
Description: 1）实现二路归并排序算法。
2）实现希尔排序算法。
3）实现快速排序算法。
4）实现堆排序算法。
（6）已知长度为n的线性表A采用顺序存储结构，该算法删除线性表中所有值为item的数据元素。删除后的数组元素与原数组元素不必保持顺序一致。
一个主函数,调试上述算法。-1) Achieving way merge sorting algorithm. 2) Achieving Hill sorting algorithms. 3) The fast sorting algorithms. 4) The realization of the heap sorting algorithm. (6) known to the length of n-linear form A sequence-storage structure, the algorithm is linear in the table to delete all values of data elements for the item. Deletion of the array elements with the original order of the array elements do not have to keep in line. A main function, debugging the algorithm. Platform: |
Size: 588800 |
Author:demoncat |
Hits:
Description: k路归并排序算法，通过对从文件中读取数据并对其排序，最终写回文件
-k way merge sort algorithm, to read data from the file and its sort, the final write-back file Platform: |
Size: 20480 |
Author:张志林 |
Hits:
Description: 合并排序是建立在归并操作上的一种有效的排序算法。该算法是采用分治法（Divide and Conquer）的一个非常典型的应用。 合并排序法是将两个（或两个以上）有序表合并成一个新的有序表，即把待排序序列分为若干个子序列，每个子序列是有序的。然后再把有序子序列合并为整体有序序列。 将已有序的子序列合并，得到完全有序的序列；即先使每个子序列有序，再使子序列段间有序。若将两个有序表合并成一个有序表，称为2-路归并。合并排序也叫归并排序。-Merge Sort is an efficient sorting algorithm merge operation. The algorithm is a typical application of the divide-and-conquer method (Divide and Conquer). Merge sort method is to merge the two (or more) ordered table into a new ordered table to be sorted sequence is divided into a number of sub-sequences, each sub-sequence is ordered. Then put ordered subsequence combined into the overall ordered sequence. Merger will have been ordered sub-sequence, to obtain a complete orderly sequence i.e. so that each first sub-sequence ordered, and then between the sub-sequence segment orderly. If you merge the two ordered list into an ordered table, known as the 2- way merge. The merger the sort also called merge sort. Platform: |
Size: 1024 |
Author:wangshuangxi |
Hits:
Description: 给定k 个排好序的序列s , s , , sk 1 2 , 用 2 路合并算法将这k 个序列合并成一个序列。
假设所采用的 2 路合并算法合并 2 个长度分别为m和n的序列需要m + n -1次比较。试设
计一个算法确定合并这个序列的最优合并顺序，使所需的总比较次数最少-Given k sorted sequence s, s, sk 1 2 2-way merge algorithm these the k sequences merged into a single sequence. The assumptions used in 2-way merge algorithm combined length of 2 m+ n-1 comparisons need for the sequence of m and n, respectively. Try to design an algorithm to determine the optimal merge order to merge the sequence, so that the total number of comparisons required at least Platform: |
Size: 1024 |
Author:王培源 |
Hits:
Description: 本文详细介绍了二路归并算法并附有代码，是很好的学习资料-This paper describes a two-way merge algorithm together with the code, is a very good learning materials Platform: |
Size: 3072 |
Author:zrx2 |
Hits:
Description: pthread实现二路归并算法的并行化。对1000000个随机生成的0-99之间的数字进行排序。-Pthread implementation of the two way merge algorithm. Sorting the numbers between 1000000 randomly generated 0-99.
Platform: |
Size: 12841984 |
Author:李萌萌 |
Hits:
Search - way merge algorithm