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: 本程序完成实验要求的全部功能直接插入排序、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 very useful program that includes the following sort algorithms: Merge, Insertion, Radix, Heap, Bucket, Quick, Counting Platform: |
Size: 3317 |
Author:besoyal@yahoo.gr |
Hits:
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:
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: 471040 |
Author:wyk |
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: 97280 |
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: 53248 |
Author:谢树扬 |
Hits:
Description: 利用随机函数产生30000个随机整数，利用插入排序、起泡排序、选择排序、快速排序、堆排序、归并排序等排序方法进行排序，并统计每一种排序上机所花费的时间-Using random functions to generate 30,000 random integers, the use of insertion sort, bubbling sort, select sort, quick sort, heap sort, merge sort and other sorting methods to sort and sort each type of statistics on the time machine Platform: |
Size: 4096 |
Author:sufei |
Hits:
Description: 一 ：排序n个元素，元素为随机生成的长为1~16的字符串，n的取值为2k（k取4、6、8、10、12、16、18、20），排序算法分别为直接插入排序， 冒泡排序，堆排序，归并排序，快速排序，比较各种排序在不同输入下的运行时间.
二：排序n个元素，元素为随机生成的1~10000的正整数，n的取值为2k（k取4、6、8、10、12、16、18、20），排序算法分别为直接插入排序，快速排序，基数排序，计数排序，比较各种排序在不同输入下的运行时间.-1: sort n elements, element for a length of randomly generated 1 ~ 16 of the string, n value for 2k (k check 4,6,8,10,12,16,18,20), sorting algorithms, respectively, for direct insertion sort, bubble sort, heap sort, merge sort, quick sort, compare different sort of run-time input. b: to sort n elements, element for the randomly generated one ~ 10000 positive integer, n value for 2k (k check 4,6,8,10,12,16,18,20), sorting algorithms, respectively, for direct insertion sort, Quick Sort, Radix Sort, Counting Sort, compare, under different input in order the running time. Platform: |
Size: 3072 |
Author:mhb |
Hits:
Description: 给定N个int类型（自定N的上限M，例如M=100000，N的取值不能少于10000）的整数，分别使用插入排序、快速排序、归并排序和堆排序方法进行升幂排序。-Int a given N-type (the upper limit of N self-M, for example, M = 100000, N value should not less than 10000) integer, respectively, using the insertion sort, quick sort, merge sort and heap sort methods or power sequencing. Platform: |
Size: 318464 |
Author:nemo |
Hits:
Description: java中几种常用的排序算法。
用Java语言实现的各种排序，包括插入排序、冒泡排序、选择排序、Shell排序、快速排序、归并排序、堆排序、SortUtil等。-java of several commonly used sorting algorithm. Using Java language to achieve a variety of sorting, including the Insertion Sort, Bubble Sort, Selection Sort, Shell Sort, Quick Sort, Merge Sort, Heap Sort, SortUtil such. Platform: |
Size: 3072 |
Author:alonso |
Hits:
Description: 自己编写的排序算法的代码，有桶排序，计数排序，基数排序，归并排序，堆排序，插入排序，快速排序，选择排序。-Sorting algorithm I have written the code, there are barrels of sorting, counting sort, Radix Sort, Merge Sort, Heap Sort, Insertion Sort, Quick Sort, select Sort. Platform: |
Size: 4096 |
Author:yiming |
Hits:
Description:
设计一个Visual C++程序实现几种排序方法，要求输入一组数组之后，可以算出其几种排序的结果，即，依次为：直接插入排序，希尔排序，冒泡排序，快速排序，简单选择排序，堆排序，归并排序。
-To design a Visual C++ procedures for implementation of several sorting methods, for the importation of a group of the array, you can calculate the number of sequencing results, that is, as follows: Direct Insertion Sort, Hill sort, bubble sort, quick sort, selection sort easy , heap sort, merge sort. Platform: |
Size: 7168 |
Author:韩小寒 |
Hits:
Description: 排序算法的C语言实现（其中包括插入排序、归并排序、快速排序和SHELL排序的实现及各排序算法所需时间的比较）-Sorting algorithm to achieve the C language (including insertion sort, merge sort, quick sort and the realization of SHELL Sort sorting algorithm and the time required for comparison) Platform: |
Size: 14336 |
Author:朱 |
Hits:
Description: Insertion sort is a simple sorting algorithm: a comparison sort in which the sorted array (or list) is built one entry at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort Platform: |
Size: 1024 |
Author:irisrd |
Hits:
Search - merge insertion sort