On 11/6/06, [EMAIL PROTECTED] <[EMAIL PROTECTED]> wrote:
>
> Now I wrote a recursive function, that calculates the minimal path sum
> for a matrix N=80 :
>
> =========================
> unsigned long long sum(int i, int j) {
> =========================
>
> Now, the code works pretty fast for small matrices, but it's running
> since last night on the mentioned matrix of size 80*80.The number ofJust make sure you don't call a particular sum(i,j) more than once (fill up a table as a "cache" each time you calculate it, and don't calculate it again), and you'll do fine. This is called "memoisation". (That's not a spelling mistake. Unless you're American, in which case it's "memoization", and is still not "memorization" :-)) --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups-beta.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
