Loading ...
Sorry, an error occurred while loading the content.
 

Correction Regarding the O'Caml Fibonnaci Program

Expand Messages
  • Shlomi Fish
    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
    Message 1 of 1 , Dec 30, 2002
      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 shlomif@...
      Home Page: http://t2.technion.ac.il/~shlomif/
      Home E-mail: shlomif@...

      "Let's suppose you have a table with 2^n cups..."
      "Wait a second - is n a natural number?"
    Your message has been successfully submitted and would be delivered to recipients shortly.