My code successfully compiles when I run the makefile. When I go to run the program, it outputs 4: {(2,0), (0,1), (3,2), (1,3)}, but then says Bus Error (core dumped). I understand this has something to do with allocation of memory, but I can't seem to figure out what is causing this. The NQueensProblemSingleSolution.h and testNQueens.cc were given and I wrote NQueensProblemSingleSolution.cc. I would appreciate any help you can give me. Thank you.

NQueensProblemSingleSolution.h:

#ifndef NQUEENSPROBLEMSINGLESOLUTION_H // Avoid double includes
#define NQUEENSPROBLEMSINGLESOLUTION_H // Prevent double include

#include <iostream>

using namespace std;

class NQueensProblemSingleSolution {
private:
int n;
int *solutionVector;
public:
NQueensProblemSingleSolution(int numberOfQueens);
NQueensProblemSingleSolution(const NQueensProblemSingleSolution& solution);
~NQueensProblemSingleSolution();
NQueensProblemSingleSolution& operator=(const NQueensProblemSingleSolution& rhs);
friend ostream& operator<<(ostream& out, const NQueensProblemSingleSolution& solution);
};

#endif

NQueensProblemSingleSolution.cc:

#include "NQueensProblemSingleSolution.h"

using namespace std;

NQueensProblemSingleSolution::NQueensProblemSingleSolution(int numberOfQueens)
{
int i, j;

delete[] solutionVector;
n = numberOfQueens;
solutionVector = new int[n];

if ((n % 2) != 0)
{
--n;
solutionVector[n] = n;

}

if(n % 6 - 2 == 0)
{
for (int m = 1; m<=n/2; m++)
{ for(int k = 0; k<2; k++)
{
if(k == 0)
{
j = 1 + (2*(m-1) + n/2 - 1) % n;
i = m;
}
else
{
j = n - (2*(m-1) + n/2 - 1) % n;
i = n + 1 - m;
}
solutionVector[--j] = --i;
}
}

}

else
{
for (int m = 0; m<=n/2; m++)
{
for (int k = 0; k<2; k++)
{
if(k==0)
{
j = 2*m;
i = m;
}
else
{
j = 2*m-1;
i = n/2 + m;
}
solutionVector[--j] = --i;
}
}

}

else
{
for (int m = 0; m<=n/2; m++)
{
for (int k = 0; k<2; k++)
{
if(k==0)
{
j = 2*m;
i = m;
}
else
{
j = 2*m-1;
i = n/2 + m;
}
solutionVector[--j] = --i;
}
}
}

}

NQueensProblemSingleSolution::NQueensProblemSingleSolution(const NQueensProblemSingleSolution& solution)
{
n = solution.n;
solutionVector = new int[n];
for (int i = 0; i<n; i++)
solutionVector[i] = solution.solutionVector[i];
solutionVector[n] = 0;
}

NQueensProblemSingleSolution::~NQueensProblemSingleSolution()
{
delete[] solutionVector;
}

NQueensProblemSingleSolution& NQueensProblemSingleSolution::operator=(const NQueensProblemSingleSolution& rhs)
{
if (this == &rhs)
return *this;
delete[] solutionVector;
n = rhs.n;
solutionVector = new int[n];
for (int i = 0; i<n; i++)
solutionVector[i] = rhs.solutionVector[i];
solutionVector[n] = 0;
return *this;
}

ostream& operator<<(ostream& out, const NQueensProblemSingleSolution& solution)
{
out<<"{";
for (int j = 0; j<solution.n; j++)
{ if(j == solution.n-1)
out<<"("<<solution.solutionVector[j]<<","<<j<<")";
else
out<<"("<<solution.solutionVector[j]<<","<<j<<"), ";
}

out<<"}"<<endl;
}

testNQueens.cc:

#include "NQueensProblemSingleSolution.h"

int main()
{
/*
* The following output should be produced:
*
* 4: {(2,0), (0,1), (3,2), (1,3)}
* 5: {(2,0), (0,1), (3,2), (1,3), (4,4)} ...
*/

for (int i = 4; i <= 16; i++) {
NQueensProblemSingleSolution result = NQueensProblemSingleSolution(i);
cout << i << ": " << result << endl;
}

return(0);
}