Welcome![Sign In][Sign Up]
Location:
Search - 希尔算法排序

Search list

[Other希尔排序算法实现

Description: 希尔排序算法实现-Hill Sorting Algorithm
Platform: | Size: 2961 | Author: 哈哈 | Hits:

[Other resource插入排序的改进算法—希尔排序算发1

Description: 插入排序的直接改进算法--希尔排序算法.将用户输入的一列数按递增顺序排好并输出.以及直接插入冒泡选择排序算法的实现-inserted directly improve the ranking algorithm -- Hill sorting algorithms. Users input a few in increasing order to arrange and output. Bubble and direct insertion Selection Sorting Algorithm Implementation
Platform: | Size: 1801 | Author: 王伟 | Hits:

[SourceCode希尔算法排序

Description: 希尔算法排序
Platform: | Size: 624 | Author: 497065057@qq.com | Hits:

[Other希尔排序算法实现

Description: 希尔排序算法实现-Hill Sorting Algorithm
Platform: | Size: 3072 | Author: 哈哈 | Hits:

[Data structs各种排序比较

Description: 分别实现直接插入排序、冒泡排序、简单选择排序、希尔排序、快速排序、堆排序,并随机生成30个数,比较各算法的时、空性能和稳定性。-respectively direct insertion sort, bubble sort, simple choice, in order of ranking Hill, the quick sort, heap sort, and Random Number Generation 30, a comparison algorithm, the performance and stability of the air.
Platform: | Size: 342016 | Author: 李景良 | Hits:

[Data structs排序程序

Description: 利用C语言实现,8种排序算法! 例如:插入排序、快速排序、选择排序、冒泡排序、堆排序、希尔排序、归并排序、基数排序!-using C language, eight algorithm! For example : insert sequencing, Quick Sort, select, in order of Bubble Sort, heap sort, Hill sorting, merging, in order of ranking base!
Platform: | Size: 3072 | Author: 叶兆源 | Hits:

[Data structs内部排序的主要算法及相关可实现程序

Description: 内部排序的所有算法,而且有相关可执行例子,包括插入排序,选择排序,希尔排序,快速排序,堆排序,归并排序等,很全,很孀。-sequencing of all internal algorithm, but is related to the executable examples, including insertion sort, select, in order of ranking Hill, the quick sort, heap sort, merging sequencing, all very, very widow.
Platform: | Size: 13312 | Author: 李雷 | Hits:

[Data structs插入排序的改进算法—希尔排序算发1

Description: 插入排序的直接改进算法--希尔排序算法.将用户输入的一列数按递增顺序排好并输出.以及直接插入冒泡选择排序算法的实现-inserted directly improve the ranking algorithm-- Hill sorting algorithms. Users input a few in increasing order to arrange and output. Bubble and direct insertion Selection Sorting Algorithm Implementation
Platform: | Size: 1024 | Author: 王伟 | Hits:

[Data structs排序算法汇总和比较

Description: 实现了插入排序,希尔排序, 冒泡排序,快速排序,选择排序,堆排序和归并排序,以及可以对排序的性能进行分析,较适合用作排序算法的学习-achieved insertion sort, Hill, in order Bubble Sort, quick sort, select, in order of ranking and sculpture merge sorting, and sequencing can analyze the performance and more appropriate for the learning algorithm
Platform: | Size: 1902592 | Author: 叶靥 | Hits:

[Data structs排序算法-java

Description: 用java实现的数据结构排序算法,包括:选择排序、插入排序、冒泡排序、希尔排序、快速排序、堆排序、归并排序。-used to achieve the ranking algorithm data structure, including : Select, in order of insertion sequence and Bubble Sort, Hill sequencing, rapid sequencing, heap sort, merging sequencing.
Platform: | Size: 54272 | Author: 陈为 | Hits:

[OS program0305111

Description: 很好的一个DD。。 能够进行快速排序...利用C语言实现,8种排序算法! 例如:插入排序、快速排序、选择排序、冒泡排序、堆排序、希尔排序、归并排序、基数排序!-good a DD. . To conduct rapid sequencing ... use C language, eight algorithm! For example : insert sequencing, Quick Sort, select, in order of Bubble Sort, heap sort, Hill sorting, merging, in order of ranking base!
Platform: | Size: 5120 | Author: 333 | Hits:

[Data structsshellsort111

Description: 附有本人超级详细解释(看不懂的面壁十天!) 一、 实际问题: 希尔排序(Shell Sort)是插入排序的一种。因D.L.Shell于1959年提出而得名。它又称“缩小增量分类法”,在时间效率上比插入、比较、冒泡等排序算法有了较大改进。能对无序序列按一定规律进行排序。 二、数学模型: 先取一个小于n的整数d1作为第一个增量,把文件的全部记录分成d1个组。所有距离为dl的倍数的记录放在同一个组中。先在各组内进行直接插人排序;然后,取第二个增量d2<d1重复上述的分组和排序,直至所取的增量dt=1(dt<dt-l<…<d2<d1),即所有记录放在同一组中进行直接插入排序为止。该方法实质上是一种分组插入方法。 三、算法设计: 1、将相隔某个增量dlta[k]的元素构成一个子序列。在排序过程中,逐次减小这个增量,最后当h减到1时,进行一次插入排序,排序就完成。增量序列一般采用:dlta[k]=2t-k+1-1,其中t为排序趟数,1≤k≤t≤[log2 (n+1)],其中n为待排序序列的长度。按增量序列dlta[0..t-1]。 2、按增量dlta[k](1≤k≤t≤[log2 (n+1)])进行一趟希尔插入排序。 3、在主函数中控制程序执行流程。 4、时间复杂度:1≤k≤t≤[log2 (n+1)]时为O(n3/2)。 -with super detailed explanation (not read the Wall for 10 days!) A practical question : Sort Hill (Shell Sort) is inserted into a sort. By D. L. Shell made in 1959 and named after. It is also known as the "narrow incremental method" in the time-efficient than inserted, such as sorting algorithms and bubbling there has been a big improvement. The disorder can sequence by law must rank. Two mathematical models : first getting a less than n integers d1 as an increment. all documents should be recorded into d1 groups. All distance dl in multiples of record on the same group. In the first group for direct insertion sorting; Then, take a second increment d2
Platform: | Size: 19456 | Author: 乐乐 | Hits:

[Algorithmshell(c++)

Description: 经典的希尔排序算法,对大家学习数据结构及培养编程思想有所启发!-classic Hill sorting algorithm for data to study the structure and culture programming philosophy inspired!
Platform: | Size: 5120 | Author: 阿科 | Hits:

[Windows Developgezhongpaixu

Description: 这是一个数据结构的综合性实验,是实现各种排序算法,如插入排序,希尔排序-This a comprehensive data structure of the experiment, the realization of sorting algorithm, such as insertion sort, Hill ranking
Platform: | Size: 3072 | Author: 刘培坚 | Hits:

[Othermy-sort

Description: 内部排序算法比较,6种常用的内部排序算法进行实测比较:一趟冒泡排序、简单选择排序、快速排序、希尔排序、直接插入排序、堆排序。-internal sorting algorithm, six kinds of internal sorting algorithm measured comparison : Bubble Sort trip, Sort simple choice, quick sort, Hill, ranked direct insertion sort, heap sort.
Platform: | Size: 1284096 | Author: 马全 | Hits:

[Data structsSort_Demo

Description: *一个简单的能够形象演示各种排序算法的applet小程序 *类似于Sun公司的示例程序,但比它复杂 *因为这个程序支持简单选择排序,冒泡排序,双向冒泡, *快速排序,希尔排序,堆排序,归并排序共七种排序算法 *每次80个整数随机生成,七种算法同时运行,之间的对比非常明显-* a simple image can be demonstrated by various sort algorithm small applet procedures similar to the Sun Public* Secretary of the sample program, but complex than it is because of this procedure* support a simple choice of sequencing, bubble sort, and two-way Bubble,* Quick Sort, Hill sequencing, heap sort, merging a total of seven Sorting Algorithm* 80 each integer random generation, Seven algorithm running, the contrast between the very obvious
Platform: | Size: 43008 | Author: 徐阳 | Hits:

[Data structscompositor_arithmetic

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: 53248 | Author: 谢树扬 | Hits:

[Data structssort

Description: 这是数据结构的课程设计,对起泡排序、直接排序、简单选择排序、快速排序、希尔排序和堆排序算法进行比较和分析,C语言实现。-This is the data structure of the curriculum design, sort of sparkling, direct sequencing, a simple selection sort, quick sort, Hill sort and heap sort algorithm comparison and analysis, C language.
Platform: | Size: 196608 | Author: Anse | Hits:

[Data structs8640希尔排序

Description: 用C语言言实现希尔排序。希尔排序(Shell Sort)是插入排序的一种。也称缩小增量排序,是直接插入排序算法的一种更高效的改进版本。(Using C language to achieve Hill sort.The Hill sort (Shell Sort) is a sort of insertion sort. Also called reduced delta sort is a more efficient version of the sorting algorithm directly inserted.)
Platform: | Size: 1024 | Author: chen陈 | Hits:

[Data structs希尔排序

Description: 希尔排序(Shell Sort)是插入排序的一种。也称缩小增量排序,是直接插入排序算法的一种更高效的改进版本。希尔排序是非稳定排序算法。该方法因DL.Shell于1959年提出而得名。 希尔排序是把记录按下标的一定增量分组,对每组使用直接插入排序算法排序;随着增量逐渐减少,每组包含的关键词越来越多,当增量减至1时,整个文件恰被分成一组,算法便终止。(Hill sorting (Shell Sort) is a sort of insertion sort. Also known as narrowing incremental sort, is a more efficient version of the direct insertion sort algorithm. The Hill sort is an unstable sorting algorithm. The method was named after DL.Shell was put forward in 1959. The Hill sort is grouped by a certain increment of the record. Each group uses direct insertion sort algorithm. As the increment gradually decreases, each group contains more and more keywords. When the increment is reduced to 1, the whole file is divided into one group and the algorithm terminates.)
Platform: | Size: 1024 | Author: 晴栀菀歌° | Hits:
« 12 3 4 5 6 7 8 9 10 ... 19 »

CodeBus www.codebus.net