Description: Nfib is our next example of benchmarking algorithms, it is closely
related to the Fibonacci series, and gives
a broad idea of the speed of procedure calls in the interpreter. It
relies on its rather peculiar property
that the integer that it returns is the same as the number of procedure
calls needed to generate the number.
To Search:
File list (Check if you may need any files):
Comb.java
lit
lit.dtd
litJava.txt
MariusExample.lit
TreeProblem.lit
Weave.java
Download