Magic squares of doubly even order: Difference between revisions
Content deleted Content added
m →{{header|Java}}: less obscure |
m →{{header|Java}}: small change |
||
Line 59:
int[][] result = new int[n][n];
for (int r = 0, i = 0; r < n; r++) {
for (int c = 0; c < n; c++, i++) {
int bitsPos = c / mult + (r / mult) * 4;
}
}
return result;
}
|