快排

//快排#include<iostream>#include<cstdlib>using namespace std;void QuickSort(int *a, int l, int r){int lt = l, rt = r;int md = (l + r) / 2;int f = a[(l + r) / 2];//int mid = a[md];while (lt < rt){while (a[lt] < f)lt++;while (a[rt] > f)rt--;if (lt <= rt){int temp = a[lt];a[lt] = a[rt];a[rt] = temp;lt++;rt--;}}if (lt == rt){lt++;}if (lt < r)QuickSort(a, rt + 1, r);if (rt > l)QuickSort(a, l, lt - 1);}int main(){int a[10] = { 3,5,9,8,0,1,2,7,6,10 };int n = 10;for (int i = 0; i < 10; i++)cout << a[i] << " ";cout << endl;QuickSort(a, 0, 9);for (int i = 0; i < 10; i++)cout << a[i] << " ";system("pause");return 0;}