快速排序

#include<cstdio>
#include<ctime>
#include<algorithm>
using namespace std;

const int MAXN = 1e5 + 5;

int arr[MAXN];

int findPivot(int *a, int l, int r)
{
    int piv = a[l];
    while (l < r)
    {
        while (l < r&&a[r] >= piv) r--;
        if (l < r) a[l] = a[r];
        while (l < r&&a[l] <= piv) l++;
        if (l < r) a[r] = a[l];
    }
    a[l] = piv;
    return l;
}

void quickSort(int *a,int l,int r)
{
    if (l >= r) return;
    int pivot = findPivot(a, l, r);
    quickSort(a, l, pivot - 1);
    quickSort(a, pivot + 1, r);
}

bool checkSort(int *a, int n)
{
    for (int i = 1; i < n; i++)
        if (a[i - 1] > a[i])
            return false;
    return true;
}

int main()
{
    int n; scanf("%d", &n);
    srand(unsigned(time(NULL)));
    for (int i = 0; i < n; i++)
        arr[i] = rand();
    quickSort(arr, 0, n - 1);
    if (checkSort(arr, n)) printf("yes\n");
    else printf("no\n");
    system("pause");
    return 0;
}