1
/* The Great Computer Language Shootout
2
http://shootout.alioth.debian.org/
3
contributed by Isaac Gouy */
10
var maxPerm = Array(n);
11
var maxFlipsCount = 0;
15
for (var i = 0; i < n; i++) perm1[i] = i;
21
// write-out the first 30 permutations
25
for(var i=0; i<n; i++) s += (perm1[i]+1).toString();
31
while (r != 1) { count[r - 1] = r; r--; }
33
if (!(perm1[0] == 0 || perm1[m] == m)) {
35
for (var i = 0; i < n; i++) perm[i] = perm1[i];
42
while (!((k = perm[0]) == 0)) {
43
var k2 = (k + 1) >> 1;
45
for (var i = 0; i < k2; i++) {
46
var temp = perm[i]; perm[i] = perm[k - i]; perm[k - i] = temp;
53
if (flipsCount > maxFlipsCount) {
54
maxFlipsCount = flipsCount;
56
for (var i = 0; i < n; i++) maxPerm[i] = perm1[i];
63
if (r == n) return maxFlipsCount;
75
count[r] = count[r] - 1;
76
if (count[r] > 0) break;
85
var ret = fannkuch(n);