my code does not run for the input 1 and 1000 or any other larger inputs

Question

when i am trying to run this code for input 1 and 1000 it shows me segmentation fault .what will be the correction in this code ?

void sorting(int sum[],long int         


        

Answer 1

I think the problem is not in the stack size, but content of variable k

for(i=L;i<=R;i++)
{
    for(j=i;j<=R;j++)
    {
        sum[k]=i^j;
        k++;
    }
}

For L = 1, R = 1000, this loop makes k as large as 500500, which exceeds the size of sum array, which has 100000 elements.

To dirty-fix this error you could make sum array larger, but, since stack size indeed can be limited, it's better to allocate huge arrays on a heap. This is also more elegant solution in your case, because you can dynamically set required size of the array.

To allocate memory on heap you can use std::vector or C++11 unique_ptr (you could also use new[] and delete[], although recently it is advised to use methods mentioned previously, because they secure some aspects of dynamic memory allocation).

To create array with unique_ptr

std::unique_ptr sum = std::make_unique(mysize);
//or if make_unique is not available
std::unique_ptr sum(new int[mysize]);

It looks like you have arithmetic series, so you can calculate mysize using equations for the sum of arithmetic progression http://en.wikipedia.org/wiki/Arithmetic_progression#Sum

With std::vector it can be less error-prone, because std::vector can grow, so you can simply push_back() elements inside the loop.

Define sum variable

 std::vector sum;

Then inside the loop instead of sum[k]=i^j; you write

 sum.push_back(i^j);