1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
## Copyright (C) 2001-2013 Paul Kienzle
## Copyright (C) 2009 VZLU Prague
##
## 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 {Function File} {} perms (@var{v})
##
## Generate all permutations of @var{v}, one row per permutation. The
## result has size @code{factorial (@var{n}) * @var{n}}, where @var{n}
## is the length of @var{v}.
##
## As an example, @code{perms ([1, 2, 3])} returns the matrix
##
## @example
## @group
## 1 2 3
## 2 1 3
## 1 3 2
## 2 3 1
## 3 1 2
## 3 2 1
## @end group
## @end example
## @end deftypefn
function A = perms (v)
if (nargin != 1)
print_usage ();
endif
vidx = uint8 ([1:length(v)]');
n = length (vidx);
if (n == 0)
p = [];
else
p = vidx(1);
for j = 2:n
B = p;
p = zeros (prod (2:j), n, "uint8");
k = rows (B);
idx = 1:k;
for i = j:-1:1
p(idx,1:i-1) = B(:,1:i-1);
p(idx,i) = vidx(j);
p(idx,i+1:j) = B(:,i:j-1);
idx += k;
endfor
endfor
endif
A = v(p);
endfunction
%!assert (perms ([1,2,3]), [1,2,3;2,1,3;1,3,2;2,3,1;3,1,2;3,2,1])
%!assert (perms ("abc"), ["abc"; "bac"; "acb"; "bca"; "cab"; "cba"])
%!assert (perms (int8 ([1,2,3])), int8 ([1,2,3;2,1,3;1,3,2;2,3,1;3,1,2;3,2,1]))
%!error perms ()
%!error perms (1, 2)
|
