时间复杂度:O(n*logn)
实现:
C:
void quick_sort(element list[], int left, int right){
int pivot, i, j;
element temp;
if (left < right){
i = left;
j = right;
pivot = list[left].key;
do{
do
i++;
while (list[i].key < pivot);
do
j--;
while (list[i].key < pivot);
if (i < j)
SWAP(list[i], list[j], temp);
}while(i < j);
SWAP(list[left], list[right], temp);
quick_sort(list, left, j-1);
quick_sort(list, j+1, right);
}
}