Fibonacci Sequence
Each program recursively computes Fibonacci numbers using this algorithm:
Fib(0) -> 1
Fib(1) -> 1
Fib(N) -> Fib(N-2) + Fib(N-1)
Test Goal
The main objective is to measure the performance of recursive functions, and indirectly of the call stack, procedure call, and return implementations.
Input argument meaning
The argument is used to compute Fib(argument).
Results
| Language | Milliseconds | Weighted Characters |
|---|---|---|
| gcc 2.95.4 | 11 | 292 |
| gcj 3.3.2 | 72 | 249 |
| MzScheme 203 | 264 | 253 |
| Python 2.3.2 | 688 | 191 |
| Perl 5.8.0 | 948 | 231 |
| Ruby 1.7.2 | 1169 | 124 |
| Tcl 8.4.5 | 1234 | 240 |
| PHP 4.2.3 | 1847 | 184 |
Last updated: Sun Jan 18 11:15:31 CET 2004