Magic Square Construction Algorithm N × N

Magic square Construction 3×3. It is a matrix in which addition of every row , every column and both diagonals is same.

[mohamedatef]

Thank you so much. This tutorial is the best. I would like to add just a little thing; The transpose of the magic square matrix follows the same properties discussed at the beginning of the video.

[patricepavelus]

This is a really great video. I really hope that teachers in highschools explained this well. Thank you.

[b-designer]

thank you soo much for your help, i've been searching for someone who can explain it like you. thx

[SivaKumar-swfb]

Thank you for amazing explanation. Your teaching skill is very good.

[giannizamora]

This was an amazing explanation, thank you!! also the clockwise and counterclockwise visualization helps to memorize the approach to this problem

[nhlamuloreply]

You have explained this method in a very simple and understanding way, thank you so much Mr

[amanwehib]

You have made it easier to program in computer language. Thank you for that.

[personanongrata]

Well done, sir! And many thanks. Subscribed!

[jmvarquez]

I tried the algorithm and it is very well explained(it runs). and I did it 100% ... keep it up

[nhanthien]

thank teacher, i from VietNam. This video very useful, i love it

[kiliankiel]

Thank you for that very detailed and very precise explanation!

[BradenBest]

This algorithm is incorrect as it does not fully map the domain for magic squares {x ∈ Z : x > 2} (the set of all integers greater than 2). Instead, it maps {2x + 1 : x ∈ Z : x > 0} (the set of all positive odd integers), which is _half_ of the problem domain. The title and premise of this video, on the other hand, incorrectly state that the domain is the expected {x ∈ Z : x > 2}. A good programmer does not implement only half of a solution. Imagine if Windows only did _half_ of what you need it to do. Imagine if your favorite game ended abruptly at the _halfway_ point. Imagine if your OS kernel only allocated _half_ of the resources you requested. Imagine if the write syscall only wrote _half_ of the text you put in. Imagine if your lazy employee only did _half_ of the work you assigned to them. Oh wait, you're already doing that.

I wouldn't even be criticizing you if the title wasn't misleading.

Not only did I fully (as of this edit) implement the problem domain (it works with any n > 2 that doesn't overflow when n^2 or n(n^2+1)/2 are applied), but I did it using a 1 dimensional array.

That might seem crazy, but 1D arrays afford a lot of advantages over 2D arrays, especially when it comes to filling, copying and allocating space for them.

[ck]

Wow what a clear explanation 🙏🙏👍👍👍👍👍👍 super super sir 👍👍👍👍

[zehrxsyed]

thank you very much for such a good and detailed explanation sir.

[surajtopal]

Thanks a lot sir ji, I have learn lot of thing from your channel

[Ankit]

Explanation was really good BUT interest is to know keenly that how you deduce to reach upto this

[____phenixx_____]

Sir. Very very Tq for this one am not having any word to explain about my happiness tqtqqqq

[ravideshmukh]

Sir you are teaching simple things in hard manner

[opethfloyd]

This video was very helpful. Thank you so much.

[sarthakkar]

For a 3x3 matrix there will be 8 magic squares, you just explained how to make one.What about the other 7 magic squares?