Location:
Search - quicksort
Search list
Description: 快速排序法
Platform: |
Size: 1077 |
Author: |
Hits:
Description: 快速排序（Quicksort）是对冒泡排序的一种改进。由C. A. R. Hoare在1962年提出。它的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。-Quick Sort
Platform: |
Size: 1024 |
Author: xycy |
Hits:
Description: 快速排序java实现的快速排序，对于内容理解很有帮助-It is the QuickSort with the language JAVA
Platform: |
Size: 1024 |
Author: 郝庭毅 |
Hits:
Description: Visual C++ QuickSort Implementation
Platform: |
Size: 548864 |
Author: minibeetle |
Hits:
Description: 快速排序(QuickSort)是一种有效的排序算法。虽然算法在最坏的情况下运行时间为O(n^2)，但由于平均运行时间为O(nlogn)，并且在内存使用、程序实现复杂性上表现优秀，尤其是对快速排序算法进行随机化的可能，使得快速排序在一般情况下是最实用的排序方法之一。快速排序被认为是当前最优秀的内部排序方法。-Quick Sort (QuickSort) is an efficient sorting algorithms. Although the algorithm runs in the worst case time is O (n ^ 2), but because the average running time of O (nlogn), and memory usage, procedures to achieve good performance on complex, especially for fast sorting algorithm randomly of the possibility of making quick sort in general is one of the most practical sorting method. Quicksort is currently considered the best internal sorting methods.
Platform: |
Size: 1024 |
Author: 庭月照 |
Hits:
Description: QuickSort
快速排序算法
重要的排序算法之一-QuickSort
important sort idea in cs
Platform: |
Size: 1060864 |
Author: msfiona |
Hits:
Description: 实现了快速排序和二分查找算法，经典简单，并有测试截图-Quicksort and binary search algorithm
Platform: |
Size: 33792 |
Author: 高超仪 |
Hits:
Description: 快速排序算法代码，自己写的，大家可以参考参考-quicksort code
Platform: |
Size: 1024 |
Author: 李强 |
Hits:
Description: Time comparison between iterative and recursive version of quicksort and mergesort algorithm
Platform: |
Size: 60416 |
Author: gunawan |
Hits:
Description: 快速排序（快速排序）是一种快速排序算法，它被广泛应用于实践。它是用于分而治之的原则。快速排序的工作原理是划分一个给定的数组A [P。 。 R]分成两个非空的子阵列A [页。 。 Q]和A [Q + 1。 。 R]使得在[P每个元素。 。问]是小于或等于每个元素A [Q + 1。 。 R]。然后两个子阵列被递归调用快速排序排序。快速排序的细节描述如下：
1.选择一个支点值（基准）。您可以采取的第一个元素的值
枢轴值，但它可以是任何值，这是在排序的值的范围，即使它不存在于阵列中。
2.分区（划分）。重新排列以这样的方式是比所述枢轴更低所有元素去阵列的左侧部分的元素，并且比枢轴更大所有元素去阵列的右侧部分。值等于枢轴可以留在阵列的任何位置。
3.排序两个子阵列。递归地应用快速排序算法的左侧和所述阵列的右侧部分。编写一个函数模板快速排序下Fig.8.15的排序程序的参考，同时也写输入，排序和输出int数组和一个float数组元素的8潜水员程序-quickSort(快速排序) is a fast sorting algorithm, which is widely applied in practice. It is used on the principle of divide-and-conquer. quickSort works by partitioning a given array A[p . . r] into two non-empty sub-arrays A[p . . q] and A[q+1 . . r] such that every element in A[p . . q] is less than or equal to every element in A[q+1 . . r]. Then the two sub-arrays are sorted by recursive calls to quickSort. The details of quickSort are described as follows:
1. Choose a pivot value(基准). You may take the value of the first element as
pivot value, but it can be any value, which is in range of sorted values, even if it doesn t present in the array.
2. Partition(划分). Rearrange elements in such a way that all elements which are lesser than the pivot go to the left part of the array, and all elements greater than the pivot go to the right part of the array. Values equal to the pivot can stay in any position of the array.
3. Sort both sub-arrays. Apply quicksort algorithm recursively to the
Platform: |
Size: 11264 |
Author: lefter |
Hits:
Description: Sort by quicksort ... sort , c#
Platform: |
Size: 24576 |
Author: mehrdad |
Hits:
Description: 算法课上学习了快速排序，这是我课下自己实现的快排，希望对大家有用！-Solution to quicksort problem
Platform: |
Size: 1024 |
Author: 刘磊 |
Hits:
Description: 这是一个快速排序程序，我已经经过调试并成功运行，实用快捷方便。-It is a quicksort problem for the irregularity numbers,I have debuged it and successfully operationed,practical、speedy and convinience.
Platform: |
Size: 6144 |
Author: 吴峰 |
Hits:
Description: Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. Developed by Tony Hoare in 1959
Platform: |
Size: 2048 |
Author: Linh Nguyen |
Hits:
Description: 快速排序与随机快速排序，并且解决问题，计数其中重复排序次数与最大最小次数-3． Implement Quicksort and Randomized Quicksort. Answer the following questions. (1) How many comparisons will Quicksort do on a list of n elements that all have the same value? (2) What are the maximum and minimum number of comparisons will Quicksort do on a list of n elements, give an instance for maximum and minimum case respectively.
Platform: |
Size: 2048 |
Author: 马越 |
Hits:
Description: 快速排序代码，希望通过此代码，能够为c++语言新手提供学习上的帮助(Quicksort ,the Quicksort is hope to help someone study c++)
Platform: |
Size: 5120 |
Author: 紫夜风流
|
Hits:
Description: 快速排序算法，二分法搜索算法，Java程序，可以实现对数值的排序及搜索(quicksort and bionary search, java class)
Platform: |
Size: 1024 |
Author: 开心小筱
|
Hits:
Description: 实现一个快速排序，快速排序(Quicksort)是对冒泡排序的一种改进。快速排序由C. A. R. Hoare在1962年提出。它的基本思想是:通过一趟排序将要排序的数据分割成独立的两部分，其中。。。。。。(To achieve a quick sort, quick sort (Quicksort) is an improvement on bubble sort. Quick sorting was proposed by C. A. R. Hoare in 1962. The basic idea is to divide the sorted data into two separate parts by a sort of sorting......)
Platform: |
Size: 218112 |
Author: binjun
|
Hits:
Description: BITCS数据结构"快速排序"编程练习题，已AC通过，仅供参考学习(BITCS data structure programming exercises--Quicksort, which have been passed by AC, are for reference only.)
Platform: |
Size: 2048 |
Author: Finn Tian
|
Hits:
Description: 读取data把一组乱序的数字由小到大通过MergeSort与QuickSort的方式排序，并对比两种排序。(Read a list of unorder numbers and by using MergeSort and QuickSort to sort these numbers, and comparing two different type sorting.)
Platform: |
Size: 23552 |
Author: 万润快点涨 |
Hits:
«
1
2
...
4
5
6
7
8
910
11
12
13
14
...
34
»