Quick Sort
2012-10-10 17:05
260 查看
Quick Sort firstly introduced by Tony Hoare in 1960 is a divide and conquer algorithm . It is a mostly wide-used algorithm among others.
The main process of quick sort is as following:
Quick_Sort(A,i,j) //sort array A from i to j
if i<j
p = Partition(A,i,j); //
Quick_Sort(A,i,p-1)
Quick_Sort(A,p+1,j)
As procedure of QS above, the most important and difficult part is the Partition procedure which divide the array into two parts. And, all elements of each part is less or greater than an element,
which is carefully choosen by Partition, indexed by the variant named p.
相关文章推荐
- JAVA排序算法实现代码-快速(Quick Sort)排序
- a program a day 25(ds,quick sort)
- Quick Sort 快速排序
- 快速排序(Quick Sort)
- 快速排序 Quick Sort
- 【算法基础】【排序】快速排序 - Quick Sort
- 排序算法C/C++实现_快速排序(Quick Sort)
- 排序算法 - 快速排序(Quick Sort)
- Quick Sort快速排序,顶。
- PAT-PAT (Advanced Level) Practise 1101 Quick Sort (25)【二星级】
- Quick Sort
- 快速排序(Quick sort)
- 1101. Quick Sort (25)
- Quick Sort
- 快速排序(Quick Sort)小结
- 交换排序—快速排序(Quick Sort)
- Quick Sort(快速排序)
- Quick Sort
- Quick sort 及其随机化版本
- 快速排序(quick sort)