Debian Codegraph @

src/benchs/fannkuch.neko

raw
1 /* The Computer Language Shootout
2 http://shootout.alioth.debian.org/
3
4 contributed by Nicolas Cannasse
5 */
6 var n = $int($loader.args[0]);
7 if( n == null ) n = 7;
8
9 check = 0;
10 perm = $amake(n);
11 perm1 = $amake(n);
12 count = $amake(n);
13 maxPerm = $amake(n);
14 maxflips = 0;
15 m = n - 1;
16 r = n;
17 i = 0;
18 while( i < n ) { perm1[i] = i; i += 1 };
19
20 while (true) {
21 if( check < 30 ) {
22 i = 0;
23 while( i < n ) { $print(perm1[i]+1); i += 1; };
24 $print("\n");
25 check += 1;
26 }
27 while( r != 1 ) { count[r-1] = r; r -= 1; };
28 if( perm1[0] != 0 && perm1[m] != m ) {
29 i = 0;
30 while( i < n ) { perm[i] = perm1[i]; i += 1; };
31 flips = 0;
32 k = perm[0];
33 do {
34 i = 1;
35 j = k - 1;
36 while( i < j ) {
37 tmp = perm[i];
38 perm[i] = perm[j];
39 perm[j] = tmp;
40 i += 1;
41 j -= 1;
42 }
43 flips += 1;
44 j = perm[k];
45 perm[k] = k;
46 k = j;
47 } while( k != 0 );
48 if( flips > maxflips )
49 maxflips = flips;
50 }
51 while (true) {
52 if( r == n ) {
53 $print("Pfannkuchen(",n,") = ",maxflips,"\n");
54 $goto(exit);
55 }
56 perm0 = perm1[0];
57 i = 0;
58 while( i < r ) {
59 j = i + 1;
60 perm1[i] = perm1[j];
61 i = j;
62 }
63 perm1[r] = perm0;
64 count[r] -= 1;
65 if( count[r] > 0 ) break;
66 r += 1;
67 }
68 }
69 exit: