快速排序是经典的排序算法,
快速排序关键点在于轴值的选取!关于这个,一般会从两端分别取值与默认轴值进行比较,从右边找到第一个比默认值小的值,从左边找到第一个比默认值大的值,然后交换这两个“哨兵“对应的值!最终达到的效果是轴值左边的都比轴值小,右边的比轴值大!
闲话少说,直接上代码
#include <iostream>
using namespace std;
void print(int a[], int low, int high) {
for (int i = low; i < high + 1; ++i)
cout << a[i] << " ";
cout << endl;
}
int partition(int a[], int low, int high) {
int i = low, j = high;
int baseval = a[low];
while (i < j) {
while (i < j && a[j] > baseval) --j;
while (i < j && a[i] <= baseval) ++i;
a[low] = a[j];
a[j] = a[i];
a[i] = a[low];
}
a[i] = baseval;
return i;
}
void quicksort(int a[], int low, int high) {
if (low < high) {
int pivot = partition(a, low, high);
cout << "选完轴值后:" << endl;
print(a, low, high);
quicksort(a, low, pivot - 1);
quicksort(a, pivot + 1, high);
}
}
void testcase(int a[], int size) {
cout <<"排序前数据为:"<< endl;
for (int i = 0; i < size; ++i) {
cout << a[i] << "\t";
}
cout << endl;
quicksort(a, 0, size - 1);
cout <<"\n排序后数据为:"<< endl;
for (int i = 0; i < size; ++i) {
cout << a[i] << "\t";
}
cout << endl;
}
int main(void) {
int arr[] = {2, 4, 9, 3, 6, 7, 1, 5};
int size = sizeof(arr) / sizeof(arr[0]);
testcase(arr, size);
cout << "---------------------" <<endl;
int arr2[] = {5, 2, 9, 3, 6, 7, 1, 8};
int size2 = sizeof(arr2) / sizeof(arr2[0]);
testcase(arr2, size2);
}
执行结果为:
排序前数据为:
2 4 9 3 6 7 1 5
选完轴值后:
1 2 9 3 6 7 4 5
选完轴值后:
5 3 6 7 4 9
选完轴值后:
4 3 5 7 6
选完轴值后:
3 4
选完轴值后:
6 7
排序后数据为:
1 2 3 4 5 6 7 9
==================
排序前数据为:
5 2 9 3 6 7 1 8
选完轴值后:
3 2 1 5 6 7 9 8
选完轴值后:
1 2 3
选完轴值后:
1 2
选完轴值后:
6 7 9 8
选完轴值后:
7 9 8
选完轴值后:
8 9
排序后数据为:
1 2 3 5 6 7 8 9
参考链接:http://www.cnblogs.com/luchen927/archive/2012/02/29/2368070.html
python版本代码
def qsort(arr, left, right):
if left >= right:
return arr
pivot, arr = partition(arr, left, right)
arr = qsort(arr, left, pivot-1)
arr = qsort(arr, pivot+1, right)
return arr
def partition(arr, left, right):
i, j = left, right
baseval = arr[left]
while i<j:
while i<j and arr[j] > baseval:
j -= 1
while i<j and arr[i] <= baseval:
i += 1
arr[i], arr[j] = arr[j], arr[i]
arr[left], arr[i] = arr[i], arr[left]
return i, arr
lst = [3, 5, 2, 1, 4]
print lst
print qsort(lst, 0, len(lst)-1)
'''
2 1 3 5 4
'''