堆排序和选择排序都挂了，求助

#include <iostream>
#include <cmath>

using namespace std;

void choice_sort(int* pInt, int len) {
    int Min = 0;
    for (int i = 0; i < len; i++) {
        for (int j = i; j < len; j++)
            if (pInt[j] < pInt[Min]) Min = j;
        swap(pInt[i], pInt[Min]);
    }
}

void cut_sort(int* begin, int* end) {
    int len = int(end - begin) + 1;
    int lec = sqrt(len), Min;
    for (int i = 0; i < len; i += lec)
        choice_sort(begin + i, i + lec > len ? len - i + 1 : lec);
    for (int h = 0; h < len; h++) {
        Min = 0;
        for (int i = h; i < len; i += lec) {
            if (begin[i] < begin[Min]) Min = i;
            swap(begin[i], begin[h]);
        }
    }
}

int main() {
    int n;
    int a[int(1e5 + 5)];
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    cut_sort(a + 1, a + n + 1);
    for (int i = 1; i <= n; i++) cout << a[i] << ' ';
    return 0;
}