quick sort algorithm
2010-03-04 10:01
387 查看
void quick_sort(int a[], int l, int r) { int i, m; if(l >= r) return; for(m = l, i = l+1; i <= r; i++) if(a[i] < a[l]) swap(a, i, ++m); swap(a, l, m); quick_sort(a, l, m); quick_sort(a, m+1, r); }
相关文章推荐
- 快速排序与快速选择算法(quick sort and quick select algorithm)
- Algorithm: Quick Sort Mind and Related Questions
- Algorithm: quick sort implemented in python 算法导论 快速排序
- Algorithm: Quick Sort Mind and Related Questions
- 000-algorithm-quick_sort
- C/C++ Quick Sort Algorithm
- Algorithm: Quick Sort Mind and Related Questions
- C/C++ Quick Sort Algorithm
- Algorithm 3_Quick_Sort
- Algorithm: Quick Sort Mind and Related Questions
- Algorithm: Quick Sort Mind and Related Questions
- Algorithm: Quick Sort Mind and Related Questions
- Algorithm: Quick Sort Mind and Related Questions
- <algorithm> 中sort的使用
- Implementing Sort Algorithm in Delphi
- quick sort analyse
- ACM algorithm sort
- java quick sort(快速排序)
- python quick sort
- <algorithm.h>中sort对结构体排序的用法