benchmark N=?
Each chart bar shows how many times slower, one ↓ program was, compared to the fastest program.
These are not the only programs that could be written. These are not the only compilers and interpreters. These are not the only programming languages.
Column × shows how many times more each program used compared to the benchmark program that used least.
| sort | sort | sort | ||||
| × | Program Source Code | CPU secs | Elapsed secs | Memory KB | Code B | ≈ CPU Load |
|---|---|---|---|---|---|---|
| missing benchmark programs | ||||||
| Ada 2005 GNAT | No program | |||||
| ATS | No program | |||||
| C CINT | No program | |||||
| C gcc | No program | |||||
| Clojure | No program | |||||
| C# Mono | No program | |||||
| C++ g++ | No program | |||||
| Dart | No program | |||||
| Erlang HiPE | No program | |||||
| F# Mono | No program | |||||
| Fortran Intel | No program | |||||
| Go | No program | |||||
| Haskell GHC | No program | |||||
| Java 7 | No program | |||||
| JavaScript V8 | No program | |||||
| Lisp SBCL | No program | |||||
| Lua | No program | |||||
| OCaml | No program | |||||
| Pascal Free Pascal | No program | |||||
| Perl | No program | |||||
| PHP | No program | |||||
| Python 3 | No program | |||||
| Racket | No program | |||||
| Ruby 2.0 | No program | |||||
| Ruby JRuby | No program | |||||
| Scala | No program | |||||
| Smalltalk VisualWorks | No program | |||||
benchmark :
diff program output N = 7 with this output file to check your program is correct before contributing.
Each program should
- "Take a permutation of {1,...,n}, for example: {4,2,1,5,3}.
- Take the first element, here 4, and reverse the order of the first 4 elements: {5,1,2,4,3}.
- Repeat this until the first element is a 1, so flipping won't change anything more: {3,4,2,1,5}, {2,4,3,1,5}, {4,2,3,1,5}, {1,3,2,4,5}.
- Count the number of flips, here 5.
- Do this for all n! permutations, and record the maximum number of flips needed for any permutation.
- Write the first 30 permutations and the number of flips.
The conjecture is that this maximum count is approximated by n*log(n) when n goes to infinity.
FANNKUCH is an abbreviation for the German word Pfannkuchen, or pancakes, in analogy to flipping pancakes."
The fannkuch benchmark is defined in Performing Lisp Analysis of the FANNKUCH Benchmark, Kenneth R. Anderson and Duane Rettig (26KB postscript)