0

I have make a matrix A[n][n],in which n is an odd positive number(of course),and the matrix must "unwrap" itself with the number 1 in the middle then 2 to the top,then clockwise 3,4,5,..etc,until it wraps the numbers 1 and finishes with the n*n number at the upper left corner...

I've seen the algorithm for the spiral matrix which wraps itself from the outside in,mine is the absolute opposite...I need help fast on this one,if anyone has suggestions I would be very thankful!

Only C,haven't started C++ yet.

=Landoro=