Subject: Correction Regarding the O'Caml Fibonnaci Program

From: Shlomi Fish <[email-masked]>
Date: Mon, 30 Dec 2002 11:49:13 +0200 (IST)

It turned the O'Caml recursive Fibonnaci Program still behaves recursively
and has an exponential complexity. Trying to run it on large inputs takes
a long time.

The reason it was faster than gcc is because its compiler was more
efficient and produced better code.

Regards,

	Shlomi Fish

----------------------------------------------------------------------
Shlomi Fish        [email-masked]
Home Page:         http://t2.technion.ac.il/~shlomif/
Home E-mail:       [email-masked]

"Let's suppose you have a table with 2^n cups..."
"Wait a second - is n a natural number?"