Writing a test program to evaluate the computational complexity(Big O)?

From what you described, the complexity of the algo seems to be O(n ^ 2). It can be possible to try evaluating it "experimentally": just run the algo with different n values and take the computation times. Then plot the n values on the x axis of a graph and the time values on the y axis.

You should now see something approximable with a parabola.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.