1
/* The Computer Language Benchmarks Game
2
http://shootout.alioth.debian.org/
3
contributed by Isaac Gouy
4
modified by Matthew Wilson */
11
var maxPerm = Array(n);
12
var maxFlipsCount = 0;
15
for (var i = 0; i < n; i++) perm1[i] = i;
19
// write-out the first 30 permutations
22
for(var i=0; i<n; i++) s += (perm1[i]+1).toString();
27
while (r != 1) { count[r - 1] = r; r--; }
28
if (!(perm1[0] == 0 || perm1[m] == m)) {
29
for (var i = 0; i < n; i++) perm[i] = perm1[i];
37
var k2 = (k + 1) >> 1;
38
for (var i = 0; i < k2; i++) {
39
var temp = perm[i]; perm[i] = perm[k - i]; perm[k - i] = temp;
44
if (flipsCount > maxFlipsCount) {
45
maxFlipsCount = flipsCount;
46
for (var i = 0; i < n; i++) maxPerm[i] = perm1[i];
51
if (r == n) return maxFlipsCount;
61
count[r] = count[r] - 1;
62
if (count[r] > 0) break;
68
var n = parseInt(arguments[0]);
69
print("Pfannkuchen(" + n.toString() + ") = " + fannkuch(n).toString());