/mobile Handheld Friendly website

 performance measurements

Each table row shows performance measurements for this C# Mono program with a particular command-line input value N.

 N  CPU secs Elapsed secs Memory KB Code B ≈ CPU Load
100.420.4214,632564  0% 2% 2% 100%
114.064.0614,632564  0% 0% 1% 100%
1255.2055.2214,640564  0% 0% 1% 100%

Read the ↓ make, command line, and program output logs to see how this program was run.

Read fannkuch-redux benchmark to see what this program should do.

 notes

Mono JIT compiler version 3.2.3 (tarball Wed Oct 30 12:15:41 PDT 2013)
LLVM: yes(3.3svn-mono-mono/8bdedb5)
GC: sgen

 fannkuch-redux C# Mono #2 program source code

/* The Computer Language Benchmarks Game
   http://benchmarksgame.alioth.debian.org/

   contributed by Isaac Gouy, transliterated from Mike Pall's Lua program 
*/

using System;

class FannkuchRedux
{
   public static int[] fannkuch(int n) {
      int[] p = new int[n], q = new int[n], s = new int[n]; 
      int sign = 1, maxflips = 0, sum = 0, m = n-1;
      for(int i=0; i<n; i++){ p[i] = i; q[i] = i; s[i] = i; }      
      do {
         // Copy and flip.
         var q0 = p[0];                                     // Cache 0th element.
         if (q0 != 0){
            for(int i=1; i<n; i++) q[i] = p[i];             // Work on a copy.
            var flips = 1;
            do { 
               var qq = q[q0]; 
               if (qq == 0){                                // ... until 0th element is 0.
                  sum += sign*flips;
	          if (flips > maxflips) maxflips = flips;   // New maximum?
                  break; 
               } 
 	       q[q0] = q0; 
	       if (q0 >= 3){
	          int i = 1, j = q0 - 1, t;
                  do { t = q[i]; q[i] = q[j]; q[j] = t; i++; j--; } while (i < j); 
               }
	       q0 = qq; flips++;
            } while (true); 
         }
         // Permute.
         if (sign == 1){
            var t = p[1]; p[1] = p[0]; p[0] = t; sign = -1; // Rotate 0<-1.
         } else { 
            var t = p[1]; p[1] = p[2]; p[2] = t; sign = 1;  // Rotate 0<-1 and 0<-1<-2.
            for(int i=2; i<n; i++){ 
	       var sx = s[i];
	       if (sx != 0){ s[i] = sx-1; break; }
	       if (i == m) return new int[]{sum,maxflips};  // Out of permutations.
	       s[i] = i;
	       // Rotate 0<-...<-i+1.
	       t = p[0]; for(int j=0; j<=i; j++){ p[j] = p[j+1]; } p[i+1] = t;
            }
         }
      } while (true);
   }

   static void Main(string[] args){
      int n = (args.Length > 0) ? Int32.Parse(args[0]) : 7;
      var pf = fannkuch(n);
      Console.Write("{0}\nPfannkuchen({1}) = {2}\n", pf[0], n, pf[1]);
   }
}

 make, command-line, and program output logs

Wed, 30 Oct 2013 21:07:02 GMT

MAKE:
mv fannkuchredux.csharp-2.csharp fannkuchredux.csharp-2.cs
/usr/local/bin/mcs  -optimize+ -platform:x86 -out:fannkuchredux.csharp-2.csharp_run fannkuchredux.csharp-2.cs
rm fannkuchredux.csharp-2.cs
0.25s to complete and log all make actions

COMMAND LINE:
/usr/local/bin/mono --llvm --gc=sgen fannkuchredux.csharp-2.csharp_run 12

PROGRAM OUTPUT:
3968050
Pfannkuchen(12) = 65

Revised BSD license

  Home   Conclusions   License   Play