🚀 go-pugleaf

In <PETERSON-JOHN.92Oct2133900@sparrow.CS.Yale.Edu> peterson-john@CS.Yale.Edu (John C. Peterson) writes:

>The first benchmark is nfib, which indicates the basic speed of
>function calling and Int arithmetic.

>module Main where

>nfib :: Int -> Int
>nfib 0 = 1
>nfib 1 = 1
>nfib n = nfib (n-1) + nfib (n-2)

The above is an incorrect definition of nfib, it should be equivalent to

nfib :: Int -> Int
nfib 0 = 1
nfib 1 = 1
nfib n = nfib (n-1) + nfib (n-2) + 1


The idea is that the value returned by nfib is the same as the number of 
function calls required to compute it.  So each invocation of nfib adds one,
hence the extra '+ 1' in the last line of the correct definition.

e.g.
	nfib(3) -> nfib(3-1) + nfib(3-1) + 1 -> 1 + 1 + 1 -> 3
	Three invocations of nfib return 3.

A rough estimate of function calls per second can be derived by dividing the
value returned from some suitable invocation of nfib by the time required to
compute that value.

Its recommended that you find the invocation of nfib that takes nearest to
thirty seconds to run and use that.


Eliot Miranda,  Lecturer	email:	eliot@dcs.qmw.ac.uk
Department of Computer Science	ARPA:	eliot%dcs.qmw.ac.uk@nsf.ac.uk
Queen Mary Westfield College	UUCP:	eliot@qmw-dcs.uucp
Mile End Road, LONDON E1 4NS	Tel:	071 975 5229 (+44 71 975 5229)
				Fax:	081 980 6533 (+44 81 980 6533)
--
Eliot Miranda,  Lecturer	email:	eliot@dcs.qmw.ac.uk
Department of Computer Science	ARPA:	eliot%dcs.qmw.ac.uk@nsf.ac.uk
Queen Mary Westfield College	UUCP:	eliot@qmw-dcs.uucp
Mile End Road, LONDON E1 4NS	Tel:	071 975 5229 (+44 71 975 5229)
				Fax:	081 980 6533 (+44 81 980 6533)