|
static int nfib (int n) { if (n < 2) return (1); else return (1 + nfib(n-1) + nfib(n-2)); }The nfib-function computes a (large) number that also happens to be the exact number of (recusive) function calls executed during the computation. Dividing this number by the CPU-time it took to calculate the result, one gets: "the number of nfib-funtion calls per second", an indication for the speed of the Java Virtual Machine. As you can see in the source text the benchmark involves: