Hi Arvind,
For the fibonacci series, we need to memoize only the the last 2 fibonacci
numbers.
We can even avoid recursion... So our regular fibonacci algorithm is the
simplest example of a dynamic programming algorithm with memoization.
To find nth fibonacci number:
int p = 0, q = 1, f;
for (int
go for Dynamic Programing
On Tue, Oct 11, 2011 at 1:47 PM, arvind kumar wrote:
> ya ya,realy sorry..typo!its MEMOIZATION.
>
>
> On Mon, Oct 10, 2011 at 10:56 PM, Ankur Garg wrote:
>
>> Memoization ?
>>
>>
>> On Mon, Oct 10, 2011 at 6:34 PM, arvind kumar wrote:
>>
>>> Can anyone tell me how to g
ya ya,realy sorry..typo!its MEMOIZATION.
On Mon, Oct 10, 2011 at 10:56 PM, Ankur Garg wrote:
> Memoization ?
>
>
> On Mon, Oct 10, 2011 at 6:34 PM, arvind kumar wrote:
>
>> Can anyone tell me how to go about with the memorization technique to
>> retrieve values from already stored values,in case
Memoization ?
On Mon, Oct 10, 2011 at 6:34 PM, arvind kumar wrote:
> Can anyone tell me how to go about with the memorization technique to
> retrieve values from already stored values,in case of eveluating
> sequences(fibonacci series,etc).?
>
> --
> You received this message because you are sub
