数据结构与算法分析--基础.ppt

void magic(int n) // create a magic square of size n, n is odd { const int MaxSize = 51; // maximum square size int square[MaxSize][MaxSize], k, l; ? // check correctness of n if((n (MaxSize)) || (n 1)){ cerr “Error!…n out of range” range” endl; return; } else if(!(n%2)){ cerr “Error!…n is even” range” endl; return; } // n is odd. Coxeter’s rule can be used for(int i = 0; i n; i++) // initialize square to 0 for(int j = 0; j n; j++) square[i][j] = 0; square[0][(n-1)/2] = 1; // middle of first row ? // i and j ar