Re: Fibonnaci

On 2005-12-09, Richard Heathfield <invalid@xxxxxxxxxxxxxxx> wrote:
> Write it. See how slow it is? Find out why. Hint: use printf.
>
> Now think about how you could make it a lot faster. Hint: think about
> arrays.

All that's needed to change the worst-case performance to linear is a
two-element cache.
.

Relevant Pages

  • Re: Help with solutions to two DEs
    ... *slaps his forehead* oops, I just completely looked over how to solve ... for the second DE, thanks for that hint. ... Sam J. ... Prev by Date: ...
    (sci.math)
  • Re: How do I send an attachment From My Documents?
    ... Hint: It's not Word. ... > lost and confused wrote: ... >>>Did you have a question about Microsoft Word? ... Prev by Date: ...
    (microsoft.public.word.docmanagement)
  • Re: change date format
    ... (Hint: it ... has to do with 'string' data.) ... Prev by Date: ...
    (comp.lang.python)
  • Re: Fibonnaci
    ... MARQUITOS51 said: ... > Im trying to find any code in C developed to calculate the fibonnacci ... Hint: use printf. ... arrays. ...
    (comp.lang.c)
  • Re: Fibonnaci
    ... Hint: use printf. ... >> arrays. ... recursion-based solution to a memoized recursion, ...
    (comp.lang.c)