As the algorithm to use actually is described in the question I would like to point out a few issues. • Actually this algorithm is only for odd magic squares. But as this was not part of the exercise ignore it for now. • why not use n in the allocation of magic • You have lots of ifs to implement the wrapping around. A neat trick to write it more compact is to use the modulo operator it would look like: next_col = (col + 1)% n • Since you are processing input it is a good practice to check if the input is valid.

Numbers greater 99 will completely break this thing. Plagiarism Checker X Serial Number there. Also negative numbers are kinda dangerous.

I'm still teaching myself C out of KN King's C Programming: Modern Approach. Actually pretty excited I go this problem solved in under 2 hours. I asked this over on. Develop a C++ program which determines if a square matrix is a magic square. A magic square is an nxn (i.e, square) matrix of numbers containing all numbers from 1 to. I'm still teaching myself C out of KN King's C Programming: Modern Approach. Actually pretty excited I go this problem solved in under 2 hours. I asked this over on. Backyard Baseball 2001 Download Full Version Mac.