Welcome![Sign In][Sign Up]
Location:
Search - merge so

Search list

[Other resourceJavaSortingMethod

Description: java 排序,冒泡排序,快速排序,选择排序,插入排序,堆排序,归并排序等等!-java ranking, bubble sort, quick sort, select Sort, insert sequencing, heap sort, merge sort, and so on!
Platform: | Size: 6766 | Author: 丁如敏 | Hits:

[Windows Developdwqdsort111

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:

[Data structsJavaSortingMethod

Description: java 排序,冒泡排序,快速排序,选择排序,插入排序,堆排序,归并排序等等!-java ranking, bubble sort, quick sort, select Sort, insert sequencing, heap sort, merge sort, and so on!
Platform: | Size: 6144 | Author: 丁如敏 | Hits:

[Windows Developdwqdsort111

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:

[Software Engineering20044140604

Description: 因为不同的排序方法适应不同的应用环境和要求,所以选择合适的排序方法应综合考虑下列因素: ①待排序的记录数目n; ②记录的大小(规模); ③关键字的结构及其初始状态; ④对稳定性的要求; ⑤语言工具的条件; ⑥存储结构; ⑦时间和辅助空间复杂度等。 本程序对以下7种常用的内部排序算法进行实测比较:插入排序、希尔排序、起泡排序、快速排序、归并排序、选择排序、堆排序。我主要负责的是希尔排序和堆排序。 -Because of different methods to sort of adapt to different application environments and requirements, so choose the right sort of approach should consider the following factors: ① the number of records to be sorted n ② record size (scale) ③ keyword structure and initial state ④ stability requirements ⑤ conditions Language Tools ⑥ storage structure ⑦ time and space complexity, such as auxiliary. This procedure on the following seven kinds of commonly used sorting algorithm to the measured internal comparison: Insertion Sort, Hill sorting, foaming sort, quick sort, merge sort, selection sort, heap sort. I mainly responsible for sequencing and HEAPSORT Hill.
Platform: | Size: 1129472 | Author: haitty | Hits:

[WEB Codesearchresultabstract

Description: 搜索引擎结果聚类提纯 含cgi页面代码和后台处理代码 在聚类过程中将内容过于重复的页面合并,因此用户看到不同的文档将能够获取不同的信息。 -Purification clustering search engine results pages with cgi code and deal with code in the background during clustering repeat too merge pages, so users see different documents will be able to access different information.
Platform: | Size: 1071104 | Author: sisn | Hits:

[Data structssort

Description: 这是关于数据结构书中经常介绍的排序算法的具体实现,包含希尔排序、快速排序、对排序、归并排序、静态链表排序、改进的冒泡算法排序等,并且附有时间统计-This is a book on data structure often described specific sorting algorithm to achieve, including the Hill sort, quick sort, for sorting, merge sort, static ranking list, improved bubble sort algorithm and so on, and with time and Statistics
Platform: | Size: 3072 | Author: | Hits:

[Special EffectsRegionExtractsdk

Description: 彩色图像分割算法, 首先rgb到hsv,然后量化,分割成许多个小区域,然后用区域合并算法进行合并,一直预先设定的区域数目或者达到满足的聚类条件为止停止合并-Color Image Segmentation Algorithm, first of all, rgb to hsv, and then quantified, separated into many small regions, and then use the region merging algorithm to merge, has been pre-set number of regional or cluster to meet the conditions to reach so far to stop the merger
Platform: | Size: 205824 | Author: gajs | Hits:

[Data structsMerge_Sort

Description: 一个合并排序算法。是按照《算法导论》书中的讲解来写的。-A plan to merge sorting algorithm. In accordance with the
Platform: | Size: 297984 | Author: 法法 | Hits:

[Data structssomesortalgorithm

Description: 本程序实现了通常我们所用的各种排序算法,是基于1--10000的随机生成数排序,有冒泡排序,合并排序,基数排序,计数排序等算法实现。-This procedure has usually used in a variety of sorting algorithm is based on 1- 10000 sort the randomly generated number, a bubble sort, merge sort, Radix Sort, Counting Sort algorithm and so on.
Platform: | Size: 2048 | Author: yifang | Hits:

[Data structsmerge

Description: 自然合并排序算法 与归并算法MergeSort相比 没有递归的过程 是按照数组的大小依次进行合并来实现排序的算法-Natural merge sort algorithm and merging algorithm compared MergeSort not recursive process is in accordance with the size of the array in order to achieve the sort merge algorithm
Platform: | Size: 86016 | Author: cuiyuzheng | Hits:

[Windows DeveloplovePet

Description: 实用功能主要有:文件分割与合并、文件加解密(新增)、控件注册(新增)、 显示/恢复桌面(新增)、定时关机(新增)、开机自启动(新增)、显示/隐藏宠物、 定制自我情话、暂停情话播放、两岸通--简繁字体互转、窃取星号密码、位图转 换为文本、文件隐藏到位图中、发送邮件、光驱管理、系统管理等等。-Practical features include: split and merge files, file encryption and decryption (new), the control register (new), show/Recovery Desktop (new), timing shutdown (new), the boot since the launch of the (new), show/hide the pets, custom self-love, then love, then suspend the players, the two sides pass- Simplified fonts conversion, theft of asterisk password, bitmap converted to text, documents hidden map in place, sending mail, drive management, system management, etc. and so on.
Platform: | Size: 1213440 | Author: gcl | Hits:

[Data structsCSort

Description: 用C++6.0编写,采用分治法求解快速排序和归并排序所花的时间并输出,能够具体地让大家明白时间复杂度这一抽象的概念-Using C++6.0 development, the use of sub-rule method to sort quick sort and merge the time spent and output, specifically so that everyone can understand the time complexity of this abstract concept
Platform: | Size: 438272 | Author: jay | Hits:

[Special EffectsMerge

Description: 功能:将多光谱图像和全色图像融合,得到更丰富的细节信息。 全色光学图像空间细节的表现能力好,DCT变换后其主要特征集中在高频区域,而多光谱图像光谱成分丰富细腻,其主要特征集中于低频区域,因此对全色光学图像和多光谱图像分别进行DCT变换,通过适当的选择全色光学图像的高频部分和光谱图像的低频部分进行融合,进行逆DCT变换,就得到象素域的融合图像,为了增强融合效果,突出局部区域特征,采用对图像分块的原则。 -Function: the multi-spectral image and panchromatic image fusion, to be more extensive details. Panchromatic image spatial detail of the optical performance were good, DCT transform its main features focus on high-frequency region, while the spectral composition of multi-spectral images rich and delicate, its main features focusing on low-frequency region, so the full-color images and multispectral optical images DCT transform, respectively, by appropriate choice of full-color optical image of the high frequency part and low-frequency part of the spectral image fusion, the inverse DCT transform, we obtain the fused image pixel domain, in order to enhance the integration of results, highlighting the local area characteristics, using the principle of the image block.
Platform: | Size: 608256 | Author: daiweiming | Hits:

[source in ebookMERGE-SORT

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:

[JSP/JavaMerge

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:

[Special EffectsHistogram-Equalization

Description: 直方图均衡方法的基本原理是:对在图像中像素个数多的灰度值(即对画面起主要作用的灰度值)进行展宽,而对像素个数少的灰度值(即对画面不起主要作用的灰度值)进行归并。从而达到清晰图像的目的。-Histogram equalization method of the basic principle is: the more the number of pixels in the image gray value (i.e., play a major role in the picture gray values) broadening, while the small number of pixels in the gray value (i.e., the picture not play a major role in gray value) to merge. So as to achieve the purpose of a clear image.
Platform: | Size: 3072 | Author: shijian | Hits:

[Data structsmaxfieldsum

Description: 用分治法解决最大子段和问题,利用了递归和合并,使问题能够简易求解-Solve the problem with the largest sub-segment and divide and conquer method, the use of recursion and merge so that the problem can be solved simple
Platform: | Size: 148480 | Author: wen | Hits:

[OtherAraxis-Merge

Description: 一款对比软件工具merge.exe,不用安装,直接点击使用,功能强大,尤其喜欢文件夹比较能在中间部分看到文件中有多少不同。用了蛮久感觉很好用,所以分享给大家。-A contrast software tools merge. Exe, need not install, click use directly, powerful functions, especially like folder comparison to see how many files in the middle section is different.Use the quite long time the feeling is very good, so share with everyone.
Platform: | Size: 1923072 | Author: 郁小芳 | Hits:

[Delphi VCLFastReportMerge

Description: FastReport向下合并单元格打印 Fastreport只提供了抑制重复值属性(SuppressRepeated),它不能直接把框线给自动合并,这样虽然隐藏了重复值,但显示上就还是有点不太美观,所以就专门研究出了这样的一个方法。网上虽然也有许多类似的解决方法,不是过于复杂,就是操作起来很麻烦,这是最最简洁通用的一个写法,所以与大家一起分享-Merge cell print down FastReport provides only the repetition suppression value attributes (SuppressRepeated), it cannot be directly to the frame line to automatically merge, so although hidden duplicate values, but display is still a not too beautiful, so devoted to the study of the such a method. Online although there are many similar solutions, not too complex, that is, the operation very troublesome, it is the most concise and general of a writing, so with everybody to share
Platform: | Size: 575488 | Author: 陈先生 | Hits:
« 12 3 4 5 »

CodeBus www.codebus.net