C ++中的合并排序堆栈溢出

Question

此代码在数组大小为 75.000 时有效，但在为 100.000 时出现堆栈溢出错误，我该如何解决？程序需要计算两种算法的经过时间和平均时间并进行比较

这是错误开始的地方

 //_______________________________
    // MERGE SORT
    void merge(int arr[], int l, int m, int r)
    {
        int i, j, k;
        int n1 = m - l + 1;
        int n2 = r - m;

        /* create temp arrays */
    int L[100000], R[100000];

    /* Copy data to temp arrays L[] and R[] */
    for (i = 0; i < n1; i++)
        L[i] = arr[l + i];
    for (j = 0; j < n2; j++)
        R[j] = arr[m + 1 + j];

    /* Merge the temp arrays back into arr[l..r]*/
    i = 0; // Initial index of first subarray
    j = 0; // Initial index of second subarray
    k = l; // Initial index of merged subarray
    while (i < n1 && j < n2)
    {
        if (L[i] <= R[j])
        {
            arr[k] = L[i];
            i++;
        }
        else
        {
            arr[k] = R[j];
            j++;
        }
        k++;
    }

    /* Copy the remaining elements of L[], if there
    are any */
    while (i < n1)
    {
        arr[k] = L[i];
        i++;
        k++;
    }

    /* Copy the remaining elements of R[], if there
    are any */
    while (j < n2)
    {
        arr[k] = R[j];
        j++;
        k++;
    }
}

发布的一些细节！..

/* l is for left index and r is right index of the
sub-array of arr to be sorted */
void mergeSort(int arr[], int l, int r)
{
    if (l < r)
    {
        // Same as (l+r)/2, but avoids overflow for
        // large l and h
        int m = l + (r - l) / 2;

        // Sort first and second halves
        mergeSort(arr, l, m);
        mergeSort(arr, m + 1, r);

        merge(arr, l, m, r);
    }
}
// END MERGE SORT
//_______________________________

插入部分不会在 100.000 上出现任何错误，但合并部分会出现

Answer 1

堆栈大小非常小，因此请尝试将这两个大数组分配在堆中

int *L = new int[100000];
int *R = new int[100000];

... merge stuff ...

delete [] L;
delete [] R;

由于L的大小是n1，R的大小是n2，你可以这样做

int *L = new int[n1];
int *R = new int[n2];