Description: 用非递归实现快速排序
主要思想：
利用栈来消除递归-Non-recursive quicksort implementation the main idea: to eliminate the use of recursive stack Platform: |
Size: 11264 |
Author:weixiaoguoke |
Hits:
Description: 通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。-Trip will be sorted by sorting the data is separated into two independent parts, a part of all of the data than another to be a small part of all of the data, and then part of the data here are two methods for rapid sorting, the sorting process can be recursive carried out in order to achieve the data into an orderly sequence. Platform: |
Size: 1024 |
Author:马值 |
Hits:
Description: 快速排序（Quicksort）是对冒泡排序的一种改进。由C. A. R. Hoare在1962年提出。它的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。-Quick sort (Quicksort) is a bubble sort of an improvement. By the CAR Hoare in 1962. Its basic idea is: The trip sorts will want to sort the data split into two independent parts, one part of the part of all of the data than all other data should be small, then part of the data here are two methods for rapid sorting, the sorting process can be recursive, thus achieving the data into an orderly sequence. Platform: |
Size: 3072 |
Author:郑阳 |
Hits:
Description: 快速排序算法基本思想
通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。一般设置数组的第一个数为需要比较的值，把整个数组分为小于和大于该数的两部分。
我自己在写这个算法的时候，卡住了好几回，总是边界值出现问题。下面的这个实现加入了注释，希望对你能够有所帮助。-Basic idea of quick sort algorithm to sort through the trip sort of data will be separated into two independent parts, a part of all of the data than another to be a small part of all of the data, and then part of the data here are two methods for rapid sequencing , the sorting process can be recursive, thus achieving the data into an orderly sequence. The first general set of the array for the need to compare the number of values, the entire array is divided into less than and greater than the number of two parts. I write this algorithm in time, stuck several times, always boundary value problems. The following comments added to this realization, I hope you can help. Platform: |
Size: 5120 |
Author:郑阳 |
Hits:
Description: 快速排序（Quicksort）是对冒泡排序的一种改进。由C. A. R. Hoare在1962年提出。它的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。-Quick sort (Quicksort) is a bubble sort of an improvement. By the CAR Hoare in 1962. The basic idea is: sort through the trip sort of data to be split into two independent parts, a part of any data other than the part of all data to be small, then these two methods of data here are fast sorting, the sorting process can be recursive, thus achieving the data into an orderly sequence. Platform: |
Size: 1024 |
Author:浩星无恨 |
Hits:
Description: 快速排序（Quicksort）是对冒泡排序的一种改进。由C. A. R. Hoare在1962年提出。它的基本思想是：通过一趟排序将要排序的数据分割成独立的两部分，其中一部分的所有数据都比另外一部分的所有数据都要小，然后再按此方法对这两部分数据分别进行快速排序，整个排序过程可以递归进行，以此达到整个数据变成有序序列。-Quick sort (Quicksort) is a bubble sort of an improvement. By the CAR Hoare in 1962. The basic idea is: a trip to sort through the data to be sorted is divided into two independent parts, one part of the part of all of the data than the other, all data should be small, and then part of the data here are two methods for rapid sorting, the sorting process can be recursive in order to achieve the data into an orderly sequence. Platform: |
Size: 8192 |
Author:杨金 |
Hits:
Description: 快速排序，递归，不稳定的排序，栈会不溢出，可运行大数量的排序-Quick sort, recursive, an unstable sort, the stack will not overflow, you can run a large number of sorting Platform: |
Size: 1024 |
Author:映雪 |
Hits:
Description: 快排算法，基于分治策略，递归实现，适合数据结构的初学者研究。-Fast row algorithm based on divide and conquer strategies, recursive implementation, suitable for beginners study of data structures. Platform: |
Size: 925696 |
Author:刚 |
Hits:
Description: 利用c++语言并采用递归的方法编写的快速分类法，程序思路清晰，易懂。-Using c++ language and a recursive method to preparate the rapid classification, the procedures are clear and it is easy to understand. Platform: |
Size: 1024 |
Author:wengfenghua |
Hits:
Description: 在VS 2008中，用C语言写的快速排序算法。不用多余的数组，直接对原数组进行排序。在递归调用中，对于【数组组就是数组首地址】的理解会更加通透。-In VS 2008, using C language to write quick sort algorithm. No extra array directly to the original array to be sorted. In the recursive call, the group is the first address of the array [array] of understanding will be more transparent. Platform: |
Size: 989184 |
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:
Search - quicksort recursive