Hi,
I've been following this thread (though it goes over my head a bit) with
interest, but with this one you guys have lost me! =)
First of all what are Fibonnacci numbers?
Second, perhaps someone could explain to me what Ladislav's code does?
-Original Message-
I calculate the
Ladislav,
I am impressed by your recursive fib. In fact it inspired me to write a
zero finding routine in a similar manner. If I am not imposing too much,
can you tell me if it is functional programming?
Jerry
x: binsrch "x - exp - x" 'x 0 1
== 0.567143290409784
exp - x
== 0.567143290409784
Jordan,
I am impressed with your clever function. It seems to take only 10% more
time than my non-recursive version.
Jerry
