Location:
Search - rank sort
Search list
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:
Description: * 算法描述： 分段 -> 段内排序 -> 归约结果。
* 1，根进程读取输入，将元素个数广播给各个进程。
* 2，然后各进程计算段长度和段偏移。
* 3，然后根进程选择第一个段，标记站位符。
* 4，跟进程将剩余元素发送给下一进程，下一进程选择段的同时，根进程排序。
* 5，下一进程继续此过程，直到最后一个进程，所有元素都进行排序。
* 6，进程将排序好的元素，按照段偏移归约给根进程。
* 7，根进程输入结果。
* -* Algorithm description: Sub--> paragraph sort-> reduce the results.* 1, the root process to read input, will be broadcast to all elements of the process.* 2, and then the process of calculating the length and offset paragraph.* 3, and then the root process, select the first paragraph, mark at stations.* 4, with the remaining elements of the process sent to the next process, the process of choosing the next paragraph, the root process of sorting.* 5, the next process to continue this process until the last process, all the elements are sorted.* 6, the process will be good to sort elements, in accordance with the above offset to the root process of reduction.* 7, enter the results of the root process.*
Platform: |
Size: 3072 |
Author: lrl |
Hits:
Description: 快速排序的mpi并行c程序，需要mpich环境-Quick Sort mpi parallel c procedures, the need for MPICH environment
Platform: |
Size: 3072 |
Author: 李志军 |
Hits:
Description: C++编程，实现运动会成绩的统计，可以完成输入、查找、按男子或者女子或者团体总分名次或者学校编号等等进行排序输出-C++ Programming to achieve results of statistical games, you can complete the input, find, by man or woman or group scores or school ID, etc. Rank sort output
Platform: |
Size: 3072 |
Author: 明明 |
Hits:
Description: 基于MPI的并行快排和并行枚举排序的实现。属于MPI的入门级程序。-MPI-based parallel quick scheduling and parallel implementation enumeration sort. MPI belong to the entry-level procedures.
Platform: |
Size: 4096 |
Author: 兰韬 |
Hits:
Description: Rank sort algorithm implementation in a cluster of personal computers with ANSI C
Platform: |
Size: 1024 |
Author: kthomas_k |
Hits:
Description: 枚举、快速排序和正则采样排序的并行算法，附带说明，无解压密码-Enumeration, fast sorting and regular sampling of parallel sorting algorithms, annotated, non-decompression password
Platform: |
Size: 9216 |
Author: 不死鸟 |
Hits:
Description: 基于MPI的并行快速排序算法，可以通过并行快速排序提高排序速度-MPI-based parallel quick sort algorithm, you can sort through parallel quick sort to improve the speed
Platform: |
Size: 2048 |
Author: chenqing |
Hits:
Description: this the rank sort algorithm for mpi platform-this is the rank sort algorithm for mpi platform
Platform: |
Size: 1024 |
Author: Pavlos Kalogian |
Hits:
Description: 用并行mpi进行快速排序 用并行mpi进行快速排序-Using parallel mpi quick sort quick sort using parallel mpi
Platform: |
Size: 2048 |
Author: liuqiang |
Hits:
Description: Learning to Rank的一个方法，把排序问题转换成了一个分类问题，然后用支持向量机（SVM）训练出一个模型来。-Learning to Rank of a way to sort problem is transformed into a classification problem, and then use support vector machine (SVM) to train a model.
Platform: |
Size: 88064 |
Author: leo |
Hits:
Description: Sequential Rank Sort C-Sequential Rank Sort C++
Platform: |
Size: 1077248 |
Author: Shripal |
Hits:
Description: 一个简单的桶排序 MPI 例子 包括 scatter gather gatherv alltoall alltoallv 的使用 -a bucket sort MPI sample using the gather scatter gatherv alltoall and alltoallv function
Platform: |
Size: 2048 |
Author: zhidong |
Hits:
Description: Odd even sort with mpi
Platform: |
Size: 3072 |
Author: renatope30003 |
Hits:
Description: Regular Sampling Quick Sort (general quicksort)
MPI based. Original Proposed by C.J.Quinn.
Tested and developed by MPI teams in H.U.T (monteCristo)
Platform: |
Size: 5120 |
Author: montecristo |
Hits:
Description: 冒泡算法，在mpi平台下编写，适合初学者学习的。-Bubble Sort algorithm, written in the mpi platform, suitable for beginners to learn.
Platform: |
Size: 1024 |
Author: 马启超 |
Hits:
Description: quick sort in parallel version with MPI
Platform: |
Size: 1024 |
Author: Shahir Salman M |
Hits:
Description: Parallel Bucket Sort with MPI
Platform: |
Size: 2048 |
Author: billalraza |
Hits:
Description: 某大学开田径运动会，现有12名选手参加100米比赛，对应的运动员号及成绩如表所示，请按照成绩排名并输出，要求每一行输出名次、运动员号及成绩。要求用冒泡法排序。-To open a university track and field sports, currently has 12 players to participate in 100m, corresponding to the number of athletes and the results shown in the table, follow the standings and out, requires that each line of output ranking, number of athletes and results. Asked to use bubble sort method.
Platform: |
Size: 12288 |
Author: bryce |
Hits:
Description: 实现几种典型排序方法：a) Insertion Sort；b) Selection Sort；c) Bubble Sort；d) Rank Sort 分析算法的时间复杂度并测量其实际运行时间。-Order to achieve several typical methods: a) Insertion Sort b) Selection Sort c) Bubble Sort d) Rank Sort algorithm' s time complexity analysis and measure its actual running time.
Platform: |
Size: 4096 |
Author: Yuan |
Hits: