2018统考真题 未出现的最小正整数

#include <iostream>
using namespace std;
int a[] = { 2,3,4,5,69,8,6,10,77,28,12,38,27,37,18,11,2,7,89,64,23,5,3,34,324,5,1,36,32,43,435 };
int partition(int A[], int low, int high);
void quickSort(int A[], int low, int high)
{
    if (low < high)
    {
        int pivotpos=partition(A,low,high);
        quickSort(A, low, pivotpos - 1);
        quickSort(A, pivotpos + 1, high);
    }
}
int partition(int A[], int low, int high)
{
    int pivot = A[low];
    while (low < high)
    {
        while (low < high && A[high] >= pivot)
            high--;
        A[low] = A[high];
        while (low < high && A[low] <= pivot)
            low++;
        A[high] = A[low];
    }
    A[low] = pivot;
    return low;
}
int main()
{
    quickSort(a, 0, sizeof(a)/4-1);
    /*for (int i = 0; i <= sizeof(a) / 4-1; i++)
    {
        cout << a[i] << "\n";
    }*/
    int i = 0;
    if (a[i] != 1)
        cout << 1;
    else
    {
        while (a[i+1]-a[i]<=1)
            i++;
        cout << a[i]+1;
    }
    //std::cout << "Hello World!\n";
}