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

Search list

[Data structspaixu

Description: 希尔排序,快速排序,简单选择排序,冒泡排序,堆排序,插入排序,归并排序-Hill sorting, quick sort, simple choice sorting, bubble sort, heap sort, insertion sort, merge sort
Platform: | Size: 2048 | Author: 王延达 | Hits:

[Data structsMergeSort

Description: 归并(Merge)排序法是将两个(或两个以上)有序表合并成一个新的有序表,即把待排序序列分为若干个子序列,每个子序列是有序的。然后再把有序子序列合并为整体有序序列-Merge (Merge) sort is two (or more) into a new sorted list ordered table, that is to be sorted sequence is divided into several sub-sequences, each sequence is ordered. And then ordered the whole sequence into an ordered sequence
Platform: | Size: 577536 | Author: | Hits:

[Data structs301-25-6-6

Description: 编写函数merge()将两个非递减序链表合并成一个新的非递减序链表-the function merge() make two lists into one in Non decreasing order.
Platform: | Size: 1024 | Author: dada | Hits:

[Data structsSorting-Algorithm

Description: 主要排序算法的C实现,Bubble sort Selection sort Insertion sort Merge sort Heapsort Quicksort-Sorting Algorithm Implementation in C
Platform: | Size: 6144 | Author: jeoam | Hits:

[Algorithmstone

Description: 在一个圆形操场的四周摆放N堆石子(N≤100),现要将石子有次序地合并成一堆。规定每次只能选相邻的两堆合并成新的一堆,并将新的一堆的石子数,记为该次合并的得分。编一程序,读入堆数N及每堆石子数(≤100)选择一种合并石子的方案,分别得到合并这N堆石子为一堆,可以得到的最大得分和最小得分 输入包含多个例子。第一行为N,即石子堆的数目,以下一行为N个整形,分别代表每堆石子的数目。当N=0时,输入结束。 -Around the playground in a circular heap stones placed N (N ≤ 100), are to merge into a gravel pile orderly. Requirements can only choose two piles adjacent into a new pile, the pile of stones and the new number, record the score for the merger. Compile a program that reads the stack number N and the number of each pile stones (≤ 100) to choose a merger proposal stones, were obtained for the merger of the N stack a pile of stones, you can get the maximum score and minimum score Enter multiple examples. The first act N, the number of stone heap following a plastic behavior of N, representing the number of stones for each heap. When N = 0, the input end.
Platform: | Size: 3072 | Author: Li | Hits:

[Data structssuanfa

Description: 插入排序与合并排序的算法比较,比较两种算法的优劣-Comparison of insertion sort and merge
Platform: | Size: 232448 | Author: | Hits:

[Linux-Unixglxgears-opengl

Description: 这是一个Linux下的OpenGL的程序,是一个测试你的Linux是否可以顺利运行2D、3D的测试软件。   这个程序弹出一个窗口,里面有三个转动的齿轮,屏幕将显示出每五秒钟转动多少栅,所以这是一个合理的性能测试。   窗户是可以缩放的,栅数多少极大程度上依赖于窗口的大小。如果你的显示卡够好,而且你的驱动程序也配合得很好,那齿轮就跑得越快。-Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the "Software"), * to deal in the Software without restriction, including without limitation * the rights to use, copy, modify, merge, publish, distribute, sublicense, * and/or sell copies of the Software, and to permit persons to whom the * Software is furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included * in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL * BRIAN PAUL BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN * CONNECTION WITH THE SOFTWARE
Platform: | Size: 291840 | Author: | Hits:

[Special Effectssplitmerge

Description: 基于matlab的图像分割合并算法实现,运行程序时,需设定最小模块大小,可设定为2,4,8,16-image split and merge based on matlab,the program need to give the minimum module size.
Platform: | Size: 866304 | Author: chen hong | Hits:

[Mathimatics-Numerical algorithmssuanfashiyan

Description: 十个算法小程序:二分法、循环赛日程算法、归并分类算法、贪心算法、背包问题、最优装载、动态规划(多段图、0-1背包、资源分配问题)、回溯和分支限界法(子集和数问题)-Ten algorithm applet: dichotomy, round robin scheduling algorithms, merge classification algorithm, greedy algorithm, knapsack problem, the optimal loading, dynamic programming (multi-segment Figure 0-1 backpack, resource allocation), backtracking and branch and bound method (sub-set several issues)
Platform: | Size: 3476480 | Author: 钟英 | Hits:

[Data structsbiancheng1

Description: 编程实现希尔、快速、堆排序、归并排序算法,并计算每种算法的比较、交换次数、执行时间。要求准备不同数量级(100、1000、10000、20000)的待排数据存入文件;再从文件读入数据,排序;将结果写入文件中。-Programming Hill, quick, heap sort, merge sort algorithm, and calculate for each algorithm, switching frequency, the execution time. Asked to prepare a different order of magnitude (100,1000,10000,20000) row of data to be stored in the file and then read data from files, sort writes the results to file.
Platform: | Size: 2096128 | Author: 汪奔波 | Hits:

[GIS programlasmerge

Description: merge two or more LAS files
Platform: | Size: 3072 | Author: vaibav | Hits:

[JSP/JavaFileCutter

Description: 这是我自己编写的一个java程序源代码,实现了对文件的切割和合并功能-It is my own writing a Java source code, realize the file cutting and merge function
Platform: | Size: 4096 | Author: FUXING | Hits:

[Data structsmergesort

Description: 此程序完成了将链表进行归并排序得功能,主要使用c++编写-This program will be linked to the completion of the merge sort function was mainly written using c++
Platform: | Size: 1024 | Author: lijia | Hits:

[Linux-Unixlibsplit-0.2

Description: Library to split/merge files.
Platform: | Size: 2048 | Author: Sife | Hits:

[Data structssorts

Description: 插入、合并、快速、冒泡、桶排序性能分析 标准C++代码,运用面向对象的设计理念,整体结构紧凑富有逻辑性 具体算法参照《算法导论》第四版 vs2010下可以正常运行 其他环境下,请自行建立工程,并拷贝sorts目录下sorts.cpp CalTime.h CalTime.cpp的内容 -Insert, merge, quick, bubble, bucket sort performance analysis Standard C code, the use of object-oriented design, the overall logical structure of compact Specific algorithm reference "Introduction to Algorithms," Fourth Edition can run under vs2010 Other circumstances, please create your own projects, and copy the sorts directory contents sorts.cpp CalTime.h CalTime.cpp
Platform: | Size: 3653632 | Author: Beef | Hits:

[Data structsmerge

Description: 分治法排序,给定长度为n的一个序列,对其进行快速排序和求第i小数-(1) Input: A sequence of n numbers <a1, a2, . . .,an>. Output: A permutation (reordering) <a1’, a2’, . . .,an’> of the input sequence such that a1’ a2’  . . .  an’ (2) Input: A set A of n (distinct) numbers and a number i, with 1 ≤ i ≤ n. Output: The element x∈ A that is larger than exactly i- 1 other elements of A.
Platform: | Size: 2544640 | Author: 王文超 | Hits:

[VHDL-FPGA-VerilogNoiseCancel[merge]

Description: NIOS proccesoor design
Platform: | Size: 3933184 | Author: todyman | Hits:

[CSharpdgv

Description: DataGridView实现表头合并功能-Merge the header for DataGridView
Platform: | Size: 3072 | Author: 陈日召 | Hits:

[Data structsSort

Description: 算法设计,给出快速排序和归并排序的C++实现代码,并利用产生大量随机数方式比较运行时间。-Algorithm design, given the quick sort and merge sort in C++ code, and using a large number of random number generation means compare running time.
Platform: | Size: 1024 | Author: WangXiaolei | Hits:

[Data structssorting

Description: Menu driven all in one Sorting, bubble sort, Selection sort, insertion sort,Merge sort , Quick sort-Menu driven all in one Sorting, bubble sort, Selection sort, insertion sort,Merge sort , Quick sort
Platform: | Size: 27648 | Author: Prasad | Hits:
« 1 2 ... 45 46 47 48 49 50»

CodeBus www.codebus.net