Mercurial > octave
view scripts/special-matrix/magic.m @ 22489:93ea313301f9
test: Add bug ids (<#####>) to BIST tests.
* bsxfun.cc, cellfun.cc, conv2.cc, data.cc, ellipj.cc, error.cc, file-io.cc,
graphics.cc, hash.cc, mappers.cc, max.cc, rand.cc, regexp.cc, symtab.cc,
chol.cc, gzip.cc, symbfact.cc, ov-cx-diag.cc, ov-fcn-handle.cc, ov-java.cc,
Sparse.cc, accumarray.m, bitset.m, fieldnames.m, inputParser.m, interp2.m,
interpft.m, num2str.m, postpad.m, prepad.m, rat.m, rectint.m, image.m,
imread.m, imwrite.m, importdata.m, strread.m, textread.m, orderfields.m, qp.m,
axis.m, legend.m, hist.m, residue.m, setdiff.m, fftshift.m, ifftshift.m,
nthroot.m, magic.m, median.m, quantile.m, base2dec.m, strsplit.m, datestr.m,
datevec.m:
test: Add bug ids (<#####>) to BIST tests.
author | Rik <rik@octave.org> |
---|---|
date | Wed, 14 Sep 2016 16:05:16 -0700 |
parents | bac0d6f07a3e |
children | 3a2b891d0b33 3ac9f9ecfae5 |
line wrap: on
line source
## Copyright (C) 1999-2016 Paul Kienzle ## ## This file is part of Octave. ## ## Octave is free software; you can redistribute it and/or modify it ## under the terms of the GNU General Public License as published by ## the Free Software Foundation; either version 3 of the License, or (at ## your option) any later version. ## ## Octave is distributed in the hope that it will be useful, but ## WITHOUT ANY WARRANTY; without even the implied warranty of ## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU ## General Public License for more details. ## ## You should have received a copy of the GNU General Public License ## along with Octave; see the file COPYING. If not, see ## <http://www.gnu.org/licenses/>. ## -*- texinfo -*- ## @deftypefn {} {} magic (@var{n}) ## ## Create an @var{n}-by-@var{n} magic square. ## ## A magic square is an arrangement of the integers @code{1:n^2} such that the ## row sums, column sums, and diagonal sums are all equal to the same value. ## ## Note: @var{n} must be a scalar greater than or equal to 3. If you supply ## @var{n} less than 3, magic returns either a nonmagic square, or else the ## degenerate magic squares 1 and []. ## @end deftypefn function A = magic (n) if (nargin != 1) print_usage (); endif n = fix (n); if (n < 1) A = []; elseif (mod (n, 2) == 1) shift = floor ((0:n*n-1)/n); c = mod ([1:n*n] - shift + (n-3)/2, n); r = mod ([n*n:-1:1] + 2*shift, n); A(c*n+r+1) = 1:n*n; A = reshape (A, n, n); elseif (mod (n, 4) == 0) A = reshape (1:n*n, n, n)'; I = [1:4:n, 4:4:n]; J = fliplr (I); A(I,I) = A(J,J); I = [2:4:n, 3:4:n]; J = fliplr (I); A(I,I) = A(J,J); elseif (mod (n, 4) == 2) m = n/2; A = magic (m); A = [A, A+2*m*m; A+3*m*m, A+m*m]; k = (m-1)/2; if (k > 1) I = 1:m; J = [2:k, n-k+2:n]; A([I,I+m],J) = A([I+m,I],J); endif I = [1:k, k+2:m]; A([I,I+m],1) = A([I+m,I],1); I = k + 1; A([I,I+m],I) = A([I+m,I],I); endif endfunction %!test %! for i = 3:30 %! A = magic (i); %! assert (norm(diff([sum(diag(A)),sum(diag(flipud(A))),sum(A),sum(A')])),0); %! endfor ## Not a magic square but we must return something (bug #46672). ## While one day we may change the actual return of magic (2), ## this properties still must be true. %!test <46672> %! m = magic (2); %! assert (size (m), [2 2]); %! assert (unique (m), [1; 2; 3; 4]); %!assert (magic (2), [4 3; 1 2]) %!assert (isempty (magic (-1))) %!assert (isempty (magic (0))) %!assert (magic (1), 1) %!assert (magic (1.5), 1) ## Test input validation %!error magic () %!error magic (1, 2)