I think it should not be nominated. I did'nt work hard for this. Just two hour. By any shabbir, Thank you very much for nominating this article.
The criteria is not how much you work on it but how much you have provided in the short possible span
Why you are thinking ? Just check and then if problem came then tell me . 100% i will solve. I will be more pleasure If you got more issues in this program? welcome but first check this program please...
Code: public class MagicSquare { public static void main(String[] args) { int N = Integer.parseInt(args[0]); if (N % 2 == 0) throw new RuntimeException("N must be odd"); int[][] magic = new int[N][N]; int row = N-1; int col = N/2; magic[row][col] = 1; for (int i = 2; i <= N*N; i++) { if (magic[(row + 1) % N][(col + 1) % N] == 0) { row = (row + 1) % N; col = (col + 1) % N; } else { row = (row - 1 + N) % N; // don't change col } magic[row][col] = i; } // print results for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { if (magic[i][j] < 10) System.out.print(" "); // for alignment if (magic[i][j] < 100) System.out.print(" "); // for alignment System.out.print(magic[i][j] + " "); } System.out.println(); } } }