用c ++增加堆栈大小

Sha*_*dli 2 c++ stack-overflow visual-studio

我几天前问过这个问题,但它并没有解决我的问题.我无法在Visual Studio中增加堆栈大小,我使用递归方法获得高输入并导致堆栈溢出.我不能使用矢量或其他东西.我需要的是在c ++,Visual Studio中增加堆栈大小.

PS我从Visual Studio配置增加了堆栈保留大小,但是,它也没有解决我的问题.

void sorting:: MergeSort(int *theArray, int n) {


    mergesort(theArray, 0, n - 1);

}
void sorting::mergesort(int *theArray, int first, int last) {
    if (first < last) {

        int mid = (first + last) / 2;   // index of midpoint

        mergesort(theArray, first, mid);

        mergesort(theArray, mid + 1, last);

        // merge the two halves
        merge(theArray, first, mid, last);
    }
}  // end mergesort
void sorting::merge(int* theArray, int first, int mid, int last) {
    const int max_size = 500000;
    int tempArray[max_size];
    int first1 = first;     // beginning of first subarray
    int last1 = mid;        // end of first subarray
    int first2 = mid + 1;   // beginning of second subarray
    int last2 = last;       // end of second subarray
    int index = first1; // next available location in tempArray

    for (; (first1 <= last1) && (first2 <= last2); ++index) {
        if (theArray[first1] < theArray[first2]) {
            tempArray[index] = theArray[first1];
            ++first1;
        }
        else {
            tempArray[index] = theArray[first2];
            ++first2;
        }
    }
    // finish off the first subarray, if necessary
    for (; first1 <= last1; ++first1, ++index)
        tempArray[index] = theArray[first1];

    // finish off the second subarray, if necessary
    for (; first2 <= last2; ++first2, ++index)
        tempArray[index] = theArray[first2];

    // copy the result back into the original array
    for (index = first; index <= last; ++index)
        theArray[index] = tempArray[index];
    delete[] tempArray;
}  // end merge
Run Code Online (Sandbox Code Playgroud)

而我的主要功能.

  #include <iostream>
    #include <ctime>
    #include "sorting.h"

    using namespace std;



    int main()
    {
        sorting sort;
        int size = 500000;
        int *myArr=new int[size];

        for (int i = 0; i < size; i++) {
            myArr[i] = rand() % size;
        }
        cout << clock()<<"   ";
        sort.MergeSort(myArr,size);
        cout<<clock();
        cin.get();
    }
Run Code Online (Sandbox Code Playgroud)

Sha*_*dli 7

我已经解决了问题,它应该适用于我认为的所有IDE,但它肯定适用于Visual Studio.PROJECT-> Properties-> Configuration Properties-> Linker-> System-> Stack Reserve Size = 4194304.这使堆栈大小为4 MB.

  • 您的代码仍然有问题。您不需要自动变量“ tempArray”作为堆栈上的数组。您需要一个指向由int * tempArray = new int [max_size]分配的数组的指针。那将与您的语句“ delete [] tempArray”匹配。这消除了对大堆栈的需求。 (2认同)