Location:
Search - merge
Search list
Description: 数据结构（C＋＋版）的演示程序，详细演示归并排序的具体调用过程-data structure (C + + version) demonstration program, a detailed presentation of specific merge sorting process called
Platform: |
Size: 45390 |
Author: znb |
Hits:
Description: 十字链表是这样构成的：用链表模拟矩阵的行（或者列，这可以根据个人喜好来定），然后，再构造代表列的链表，将每一行中的元素节点插入到对应的列中去。书中为了少存几个表头节点，将行和列的表头节点合并到了一起——实际只是省了几个指针域，如果行和列数不等，多余的数据域就把这点省出的空间又给用了。这点小动作让我着实废了半天劲，个人感觉，优点不大，缺点不少，不如老老实实写得象个十字链表，让人也好看一些，这是教科书，目的是教学。实在看得晕的人，参阅C版的这部分内容，很清晰。我也不会画图，打个比方吧：这个十字链表的逻辑结构就像是一个围棋盘（没见过，你就想一下苍蝇拍，这个总见过吧），而非零元就好像是在棋盘上放的棋子，总共占的空间就是，确定那些线的表头节点和那些棋子代表的非零元节点。最后，我们用一个指针指向这个棋盘，这个指针就代表了这个稀疏矩阵-Crusaders is the form : Chain Simulation matrix rows (or out, This can be based on individual preferences to be), and then constructed on behalf of the chain out, Each line of the elements inserted into the node corresponding to the series. To book a few small depositors table first node, out of line and the first node table to merge together -- the reality is that a number of indicators provincial jurisdictions, if the number of rows and columns ranging, redundant data domain put this province has granted the use of the space. This little trick I did waste a half-day efforts, personal feeling, not merit, a lot of shortcomings, written as honestly as cross chain, some people are good looking, which is the textbook, and the purpose of teaching. Really see the halo, see the C version of this
Platform: |
Size: 1864 |
Author: weiran |
Hits:
Description: merge sort give a set S of n integers and another integer x, determine whether or not there exits two elements in S whose sum is exactly x.-merge sort give a set of S n integers and anot her integer x, determine whether or not there exits two elemen ts in S whose sum is exactly x.
Platform: |
Size: 1018 |
Author: 朱雨科 |
Hits:
Description: WinMerge可以显示两个文件的不同之处，并提供文件或文件夹合并功能。-WinMerge can show two different documents, and providing documents or folders merge function.
Platform: |
Size: 6702687 |
Author: fletcher |
Hits:
Description: 归并排序,算法分析与设计第二章分治法思想的归并排序算法实现,用C++写的.-merge sorting algorithm analysis and design of the second chapter ideological divide-and-conquer method of merging ranking algorithm, C writes.
Platform: |
Size: 824 |
Author: zn |
Hits:
Description: java 排序，冒泡排序，快速排序，选择排序，插入排序，堆排序，归并排序等等！-java ranking, bubble sort, quick sort, select Sort, insert sequencing, heap sort, merge sort, and so on!
Platform: |
Size: 6766 |
Author: 丁如敏 |
Hits:
Description: 本文档讲解了几种排序方式的优缺点。包含直接插入、希尔、直接选择、冒泡、快速、堆、二路归并等排序方式。-this document on the order of several ways the advantages and disadvantages. Include direct insertion, Hill, direct choice, Bubble, rapid and heaps of two-way merge, etc. Sort.
Platform: |
Size: 84453 |
Author: wyk |
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: 3861 |
Author: mxm |
Hits:
Description: 本程序完成实验要求的全部功能直接插入排序、SHELL排序、冒泡排序、快速排序、简单选择排序、堆排序、归并排序、基数排序，程序代码符合书写规范，实验报告叙述清晰完整，有详尽的分析和总结。
在实验过程中，积极配合本团队分工合作的精神，努力学习，总算不负众望，将程序编好，在此，我更想感谢的是老师的教导，在她的帮助下，我才顺利完成了本次的任务。
-the experimental procedures are completed all the functional requirements of the direct insertion sort, Shell sort, bubble sort, Quick Sort, the simple choice of sequencing, heap sort, merge sort, radix sort, code written with norms, Experimental report describes a distinct and comprehensive, detailed analysis and summary. In the course of the experiment, the team actively cooperate with the division of labor, study hard, and finally delivered to the completion of procedures, in this, I also want to thank the teacher is teaching, in her help, I will have completed this task.
Platform: |
Size: 97242 |
Author: 马全 |
Hits:
Description: 用单链表实现对两个无序 A,B表进行合并并使的合并后的表按从小到大排序
Platform: |
Size: 1542 |
Author: wodezui-i |
Hits:
Description: If we have two individually sorted vectors \"a\" and \"b\" but they are not sorted with respect to each other and we want to merge them into vector \"c\" such that \"c\" is also a sorted vector. Then c=mergesorted(a,b) can be used.
-If we have two vectors individually sorted "a" and "b" but they are not sorted with respect t o each other and we want to merge them into vector "c" such that "c" is also a sorted vector. Then c = mergesorted (a, b) can be used.
Platform: |
Size: 2719 |
Author: Tom |
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: 最近对排序算法的复习，包括直接插入排序，冒泡排序，选择排序，快速排序，归并排序，希尔排序。在VC6.0中测试通过并有简单原理说明-recent review of the sorting algorithms, including direct insertion sort, bubble sort, select Sort, quick sort, merge sort, Sort Hill. VC6.0 test in the adoption and simple Rationale
Platform: |
Size: 53381 |
Author: 谢树扬 |
Hits:
Description: 多项式的乘法和加法的实现,可以自动合并同类项-polynomial multiplication and addition of the realization, it will automatically merge similar items
Platform: |
Size: 7610 |
Author: weiboxun |
Hits:
Description: 关于二路归并排序算法的相关的一个源程序代码-on two-way merge algorithm is a relevant source code
Platform: |
Size: 1186 |
Author: 王鹤新 |
Hits:
Description: 演示动态平衡二叉树(AVL Tree)的系统.GUI环境,在Windows环境下运行,有二叉树的插入,增加,删除,修改,合并,分裂等功能.-demonstration dynamic binary tree (Tree AVL) system. GUI environment. in the Windows operating environment, a binary tree insertion, add, delete, modify, merge, split, and other functions.
Platform: |
Size: 1802353 |
Author: 有D |
Hits:
Description: 打开要合并序列的第一帧,从第一帧开始将单帧文件合并 成一个YUV文件-opened to merge the first frame sequence from the beginning of the first frame with single-frame paper documents into a YUV
Platform: |
Size: 109180 |
Author: snow |
Hits:
Description: 编写程序，实现有序链表的建立；并实现对两个有序链表的归并操作，主要实验内容如下：
1. 定义链表的数据类型（带有头结点）；
2. 实现链表的基本操作：初始化、销毁、有序插入；
3. 通过键盘输入建立一个非递减有序链表（键盘输入不一定按照非递减的顺序）
4. 对通过键盘输入而建立好的两个非递减有序链表进行归并操作，并将归并好的有序链表输出。（需要编写一个归并函数）-preparation procedures, the establishment of an orderly chain; And to achieve an orderly chain of the two merging operations, the main contents are as follows : 1. Listless definition of the data types (with the first node); 2. Listless achieve the basic operation : initialization, destruction, orderly inserted; 3. Keyboard input through the establishment of a non-regressive and orderly chain (not necessarily in accordance with the keyboard input-in descending order) 4. right links Guo keyboard input and two well-established non-regressive orderly list was merging operation and merge good and orderly chain output. (Need to prepare a merge function)
Platform: |
Size: 12374 |
Author: 段苛苛 |
Hits:
Description: voronoi图的分治算法实现，清晰展示voronoi图的merge过程。在VC6.0下实现-nibbling plan of partition algorithm, clear display triangles map merge process. Under the VC6.0
Platform: |
Size: 98418 |
Author: 马标 |
Hits:
Description: 这是一个用java写的用于操作文件的代码，主要功能是将一个文件分成一些小文件，并且可以将小文件合并-This is a java used to write documents for the operation of the code, main function is to be divided into a number of small paper documents, and can merge files
Platform: |
Size: 4433 |
Author: nudtchen |
Hits:
«
1
2
...
5
6
7
8
9
1011
12
13
14
15
...
50
»