Location:
Search - quicksort
Search list
Description: 快排，这个是我认为写得最好的快排代码了。快速排序可以在log2(n)的时间内对数组元素进行排序。-Fast row, this is my opinion, the best written fast row code. Quicksort log2 (n) time to sort the array elements.
Platform: |
Size: 139264 |
Author: 王 |
Hits:
Description: 数据结构中C语言所写的快速排序算法，与严蔚敏书上的比较一致-Quicksort algorithm, written in C language data structure book with Yan Wei Min
Platform: |
Size: 2048 |
Author: 李亚运 |
Hits:
Description: 经典快速排序算法，适合初学者理解学习，基于《算法导论》中快排的伪代码实现的-The classic Quicksort algorithm suitable for beginners to understand, based on the pseudo-code in Introduction to Algorithms.
Platform: |
Size: 5120 |
Author: tony |
Hits:
Description: 快速排序算法源代码使用C++实现，调试并运行通过-QuickSort C++
Platform: |
Size: 6021120 |
Author: 张旭 |
Hits:
Description: 快速排序，用数组的存储结构，实现数的排序。共有八组随机数据，还能够计算出每组数据的处理时间，最终得到平均时间。-Quicksort array storage structure, to achieve the sort of number. A total of eight sets of random data, but also be able to calculate the processing time of each data, and eventually obtain the average time.
Platform: |
Size: 330752 |
Author: 小乔 |
Hits:
Description: 实现quicksort的简单代码,输入数字 能用quicksort排序-Achieve quicksort simple code, enter the number can quicksort sorting
Platform: |
Size: 1024 |
Author: 段雨佳 |
Hits:
Description: Order Statistics Functions to Find the Median:
Execution Time of Different Order Statistics Functions
Very efficient Quicksort in Java
Platform: |
Size: 30720 |
Author: Hoty |
Hits:
Description: 快速排序（Quicksort）是对冒泡排序的一种改进。由C. A. R. Hoare在1962年提出。它的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。-Quick Sort (Quicksort) is an improvement on the bubble sort. By CAR Hoare in 1962. The basic idea is: sort through the trip will be to sort the data is divided into two separate parts, the part of all of the data than the other part of the data to be small, then this method were both part of the data fast sort the entire sorting process can recursively, in order to reach the entire data into an ordered sequence.
Platform: |
Size: 3072 |
Author: SmileHF |
Hits:
Description: 快速排序与随机化快速排序,控制台实现。10000以上各数测试-The quicksort randomized quick sort, to achieve console. 10,000 more than the number of test
Platform: |
Size: 1103872 |
Author: tanzhaofei |
Hits:
Description: 一个实现快速排序算法的小代码。输入任意数字进行快速排序-realize the quicksort
Platform: |
Size: 1024 |
Author: 郑林 |
Hits:
Description: Quicksort is a divide and conquer algorithm. Quicksort first divides a large list into two smaller sub-lists: the low elements and the high elements. Quicksort can then recursively sort the sub-lists.
The steps are:
Pick an element, called a pivot, from the list.
Reorder the list so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it (equal values can go either way). After this partitioning, the pivot is in its final position. This is called the partition operation.
Recursively apply the above steps to the sub-list of elements with smaller values and separately the sub-list of elements with greater values.
The base case of the recursion are lists of size zero or one, which never need to be sorted.
Platform: |
Size: 5120 |
Author: domix |
Hits:
Description: 利用omp將quicksort達到平行化效果-Omp parallel use of the quicksort
Platform: |
Size: 1024 |
Author: 黃鼎藥 |
Hits:
Description: 快速排序是由东尼·霍尔所发展的一种排序算法。在平均状况下，排序 n 个项目要Ο(n log n)次比较。在最坏状况下则需要Ο(n2)次比较，但这种状况并不常见。事实上，快速排序通常明显比其他Ο(n log n) 算法更快，因为它的内部循环（inner loop）可以在大部分的架构上很有效率地被实现出来。-Quicksort is developed by the East Ni Huoer a sorting algorithm. In the average case, sort n items to Ο (n log n) comparisons. In the worst case requires Ο (n2) comparisons, but this situation is not common. In fact, often significantly higher than the other quick sort Ο (n log n) algorithm is faster because its internal loop (inner loop) may be in most architectures it be implemented very efficiently.
Platform: |
Size: 202752 |
Author: Guangge |
Hits:
Description: A java application which creates and fills an array of size 50 with random int values. It should then display the contents of the array sort the array by calling a quicksort method and then finally display the array contents again.-A java application which creates and fills an array of size 50 with random int values. It should then display the contents of the array sort the array by calling a quicksort method and then finally display the array contents again.
Platform: |
Size: 11485184 |
Author: lennoxb |
Hits:
Description: 用快排思想的c程序。输入为元素个数+元素序列。输出为排序后的结果。与其他类似的排序程序如，插入、选择等相比，实现效率更高。-This is a quicksort program to deal with scheduling problems, which is pretty faster than other methods.
Platform: |
Size: 1024 |
Author: emma |
Hits:
Description: 快排算法QuickSort的C实现
算法高效-Fast algorithm of QuickSort C implementation
Algorithm is highly efficient
Platform: |
Size: 4774912 |
Author: zzw |
Hits:
Description: 使用MPI编程实现快速排序的并行化
(1) 并行算法的设计
设计快速排序的并行化算法，说明并行化的算法的设计思想。
(2) MPI编程
使用MPI编程实现快速排序的并行化。
(3) 对运行结果的对比和分析。
-Quick Sort programming using MPI parallelization (1) parallel algorithm design parallel algorithm design quick sort, indicating parallelized algorithm design ideas. (2) MPI programming using MPI programming quicksort parallelization. (3) Comparison and analysis of the results of running.
Platform: |
Size: 2048 |
Author: 嘉 |
Hits:
Description: 快速排序的实现，经过严格测试，代码能正常运行。-Quicksort implementation, after rigorous testing, code can be run properly.
Platform: |
Size: 2048 |
Author: jaub |
Hits:
Description: 快速排序,采用C++的分治思想。是十大排序算法中效率最高的一个-QuickSort,in C++
Platform: |
Size: 7168 |
Author: 诸葛光 |
Hits:
Description: 这是著名的快速排序算法，很经典啊,请大家熟悉！-this is a quicksort!
Platform: |
Size: 626688 |
Author: 董肖 |
Hits: