C.R.Hoare所设计的划分排序的方法,
#include<iostream>
#include<algorithm>
using namespace std;
void quick_sort(int q[], int l, int r)
{
if (l >= r) return;
int i = l - 1, j = r + 1, t = q[l + r>>1];
while (i < j) {
do i++; while (q[i] < t);
do j--; while (q[j] > t);
if(i<j) swap(q[i], q[j]);
}
quick_sort(q, l, j), quick_sort(q, j + 1, r);
}
int main()
{
int q[12] = { 10,3,2,1,6,4,1,6,3,7 };
cout << q[0] << endl;
quick_sort(q, 0, 9); //传参为起始与终止位置下标
for (int i = 0; i < 10; i++) cout << q[i]<<' ';
return 0;
}